Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Estructura datos")

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 7124

  • Page / 285
Export

Selection :

  • and

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

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

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

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

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

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

Isotropic vector matrix grid and face-centered cubic lattice data structuresNYSTROM, J. F; BELLOMO, Carryn.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26032-3, 3Vol, part III, 1096-1099Conference Paper

Efficient state updates for Key managementPINKAS, Benny.Lecture notes in computer science. 2002, pp 40-56, issn 0302-9743, isbn 3-540-43677-4Conference Paper

Lossy dictionariesPAGH, Rasmus; RODLER, Flemming Friche.Lecture notes in computer science. 2001, pp 300-311, issn 0302-9743, isbn 3-540-42493-8Conference Paper

Parlists - A generalization of powerlistsKORNERUP, J.Lecture notes in computer science. 1997, pp 614-618, issn 0302-9743, isbn 3-540-63440-1Conference Paper

Which extended Goppa codes are cyclic?STICHTENOTH, H.Journal of combinatorial theory. Series A. 1989, Vol 51, Num 2, pp 205-220, issn 0097-3165Article

No sorting? Better searching!FRANCESCHINI, Gianni; GROSSI, Roberto.Annual Symposium on Foundations of Computer Science. 2004, pp 491-498, isbn 0-7695-2228-9, 1Vol, 8 p.Conference Paper

A type specialisation tutorialHUGHES, J.Lecture notes in computer science. 1999, pp 293-325, issn 0302-9743, isbn 3-540-66710-5Conference Paper

Adaptive linear list reorganization under a generalized query systemVALIVETI, R. S; OOMMEN, B. J; ZGIERSKI, J. R et al.Journal of applied probability. 1995, Vol 32, Num 3, pp 793-804, issn 0021-9002Article

Optimal simultaneous superpositioning of multiple structures with missing dataTHEOBALD, Douglas L; STEINDEL, Phillip A.Bioinformatics (Oxford. Print). 2012, Vol 28, Num 15, pp 1972-1979, issn 1367-4803, 8 p.Article

MIRRORS OF MEANING: SUPPORTING INSPECTABLE RUNTIME MODELS : Models run.timeGJERLUFSEN, Tony; INGSTRUP, Mads; OLSEN, Jesper Wolff et al.Computer (Long Beach, CA). 2009, Vol 42, Num 10, pp 61-67, issn 0018-9162, 7 p.Article

Two-Tier Relaxed HeapsELMASRY, Amr; JENSEN, Claus; KATAJAINEN, Jyrki et al.Lecture notes in computer science. 2006, pp 308-317, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

Teaching algorithms and data structures: 10 personal observationsBIERI, Hanspeter.Computer science in perspective (essays dedicated to Thomas Ottmann). Lecture notes in computer science. 2003, pp 39-48, issn 0302-9743, isbn 3-540-00579-X, 10 p.Book Chapter

A representation for abstract simplicial complexes: An analysis and a comparisonDE FLORIANI, Leila; MORANDO, Franco; PUPPO, Enrico et al.Lecture notes in computer science. 2003, pp 454-464, issn 0302-9743, isbn 3-540-20499-7, 11 p.Conference Paper

Statistical issues in HIV Research. MeetingDARBY, Sarah; ANDERSON, Roy.Journal of the Royal Statistical Society. Series A. Statistics in society (Print). 1998, Vol 161, Num 2, pp 161-272, issn 0964-1998Conference Proceedings

On finding common subtreesGROSSI, R.Theoretical computer science. 1993, Vol 108, Num 2, pp 345-356, issn 0304-3975Article

  • Page / 285