Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Data structure")

Filter

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

Language

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

Author Country

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

Origin

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

Results 1 to 25 of 8744

  • Page / 350

Export

Selection :

  • and

On the compression of search treesCLAUDE, Francisco; NICHOLSON, Patrick K; SECO, Diego et al.Information processing & management. 2014, Vol 50, Num 2, pp 272-283, issn 0306-4573, 12 p.Article

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

Automatic detection and repair of errors in data structuresDEMSKY, Brian; RINARD, Martin.ACM SIGPLAN notices. 2003, Vol 38, Num 11, pp 78-95, issn 1523-2867, 18 p.Conference Paper

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

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

Interpolation-based index maintenanceBURKHARD, W. A.BIT (Nordisk Tidskrift for Informationsbehandling). 1983, Vol 23, Num 3, pp 274-294, issn 0006-3835Article

A paradigm for the design of parallel algorithms with applicationsRAMAKRISHNAN, I. V; BROWNE, J. P.IEEE transactions on software engineering. 1983, Vol 9, Num 4, pp 411-415, issn 0098-5589Article

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

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

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

WADS 2003 : algorithms and data structures (Ottawa ON, 30 July - 1 August 2003)Dehne, Frank; Sack, Jörg-Rüdiger; Smid, Michiel et al.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40545-3, XII, 522 p, isbn 3-540-40545-3Conference Proceedings

Circular programs and self-referential structuresALLISON, L.Software, practice & experience. 1989, Vol 19, Num 2, pp 99-109, issn 0038-0644Article

Constraint relation implementation for finite element analysis from an element basisSAN-CHENG CHANG; TSUNG-WU LIN.Advances in engineering software (1978). 1988, Vol 10, Num 4, pp 191-194, issn 0141-1195Article

Collection-oriented languagesSIPELSTEIN, J. M; BLELLOCH, G. E.Proceedings of the IEEE. 1991, Vol 79, Num 4, pp 504-523, issn 0018-9219, 20 p.Article

Neuron selection for RBF neural network classifier based on data structure preserving criterionMAO, K. Z; HUANG, Guang-Bin.IEEE transactions on neural networks. 2005, Vol 16, Num 6, pp 1531-1540, issn 1045-9227, 10 p.Article

Designing and implementing a general purpose halfedge data structureBRÖNNIMANN, Hervé.Lecture notes in computer science. 2001, pp 51-66, issn 0302-9743, isbn 3-540-42500-4Conference Paper

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

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

  • Page / 350