Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Structure donnée")


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 8751

  • Page / 351

Selection :

  • and

How to search in historyCHAZELLE, B.Information and control. 1985, Vol 64, Num 1-3, pp 77-99, issn 0019-9958Article

A balanced hierarchical data structure for multidimensional data with highly efficient dynamic characteristicsNAKAMURA, Y; ABE, S; OHSAWA, Y et al.IEEE transactions on knowledge and data engineering. 1993, Vol 5, Num 4, pp 682-694, issn 1041-4347Article

Adaptive structuring of binary search trees using conditional rotationsCHEETHAM, R. P; OOMMEN, B. J; NG, D. T. H et al.IEEE transactions on knowledge and data engineering. 1993, Vol 5, Num 4, pp 695-704, issn 1041-4347Article

Program optimization using indexed and recursive data structuresLIU, Yanhong A; STOLLER, Scott D.ACM SIGPLAN notices. 2002, Vol 37, Num 3, pp 108-118, issn 1523-2867Conference Paper

A compact representation for permutation groupsJERRUM, M.Journal of algorithms (Print). 1986, Vol 7, Num 1, pp 60-78, issn 0196-6774Article

Quadtree building algorithms on an SIMD hypercubeIBARRA, O. H; MYUNG HEE KIM.Journal of parallel and distributed computing (Print). 1993, Vol 18, Num 1, pp 71-76, issn 0743-7315Article

The power of parallel projectionVAN KREVELD, M.Information processing letters. 1993, Vol 46, Num 4, pp 185-191, issn 0020-0190Article

Analysis of Grid file algorithmsREGNIER, M.BIT (Nordisk Tidskrift for Informationsbehandling). 1985, Vol 25, Num 2, pp 335-357, issn 0006-3835Article

A theory of sequentialityBUCCIARELLI, A; EHRHARD, T.Theoretical computer science. 1993, Vol 113, Num 2, pp 273-291, issn 0304-3975Article

On the randomized construction of the Delaunay treeBOISSONNAT, J.-D; TEILLAUD, M.Theoretical computer science. 1993, Vol 112, Num 2, pp 339-354, issn 0304-3975Article

A data structure for dynamic treesSLEATOR, D. D; TARJAN, R. E.Journal of computer and system sciences (Print). 1983, Vol 26, Num 3, pp 362-391, issn 0022-0000Article

Self-adjusting heapsSLEATOR, D. D; TARJAN, R. E.SIAM journal on computing (Print). 1986, Vol 15, Num 1, pp 52-69, issn 0097-5397Article

Algorithms and data structurese (Waterloo ON, 15-17 August 2005)Dehne, Frank; Lopez-Ortiz, Alejandro; Sack, Jörg-Rüdiger et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28101-0, XIV, 446 p, isbn 3-540-28101-0Conference Proceedings

The design of dynamic data structuresOVERMARS, M. H.Lecture notes in computer science. 1983, Num 156, issn 0302-9743, VII-181 pSerial Issue

Data structure architectures = Architectures de structure de donnéesGILOI, W. K; HEGER, D.RT. Regelungstechnik. 1985, Vol 33, Num 1, pp 25-31, issn 0340-434XArticle

Log-logarithmic worst-case range queries are possible in space Θ (N)WILLARD, D. E.Information processing letters. 1983, Vol 17, Num 2, pp 81-84, issn 0020-0190Article

Algorithm theory (SWAT 2006)Arge, Lars; Freĭvalds, Rusins.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-35753-X, 1Vol, XII-436 p, isbn 3-540-35753-XConference Proceedings

A hexagonal pyramid data structure for image processingHARTMAN, N. P; TANIMOTO, S. L.IEEE transactions on systems, man, and cybernetics. 1984, Vol 14, Num 2, pp 247-256, issn 0018-9472Article

A generalized control structure and its formal definitionPARNAS, D. L.Communications of the ACM. 1983, Vol 26, Num 8, pp 572-581, issn 0001-0782Article

Searching in metric spaces by spatial approximationNAVARRO, Gonzalo.The VLDB journal. 2002, Vol 11, Num 1, pp 28-46, issn 1066-8888Article

PARM : Data Structure for Efficient Volume Ray CastingLIM, Sukhyun; SHIN, Byeong-Seok.Lecture notes in computer science. 2006, pp 296-305, issn 0302-9743, isbn 3-540-47242-8, 1Vol, 10 p.Conference Paper

Panty OBDDs cannot be handled efficiently enoughLÖBBING, M; SIELING, D; WEGENER, I et al.Information processing letters. 1998, Vol 67, Num 4, pp 163-168, issn 0020-0190Article

Separating shape from dataJAY, C. B.Lecture notes in computer science. 1997, pp 47-48, issn 0302-9743, isbn 3-540-63455-XConference Paper

Data structures for maintaining set partitionsBENDER, M. A; SETHIA, S; SKIENA, S et al.Lecture notes in computer science. 2000, pp 83-96, issn 0302-9743, isbn 3-540-67690-2Conference Paper

Efficient data structures for deduction systemsOHLBACH, H. J.Lecture notes in computer science. 1997, Vol 1341, pp 1-2, issn 0302-9743, isbn 3-540-63792-3Conference Paper

  • Page / 351