Heaps and heapsort on secondary storage
- Auteur
- FADEL, R1 ; JAKOBSEN, K. V1 ; KATAJAINEN, J1 ; TEUHOLA, J2
[1] Department of Computing, University of Copenhagen, Universitetsparken 1, 2100 Copenhagen East, Denmark
[2] Department of Computer Science, University of Turku, Lemminkäisenkatu 14 A, 20520 Turku, Finland - Titre de la conférence
- Australasian Computer Science
- Nom de la conférence
- CATS'97 Computing: Australasian Theory Symposium (Sydney 1997-02)
- Auteur (monographie)
- HARLAND, James (Editor)1
[1] Department of Computer Science, Royal Melbourne Institute of Technology, Australia - Source
Theoretical computer science. 1999, Vol 220, Num 2, pp 345-362 ; ref : 21 ref
- CODEN
- TCSCDI
- ISSN
- 0304-3975
- Domaine scientifique
- Computer science
- Editeur
- Elsevier, Amsterdam
- Pays de publication
- Netherlands
- Type de document
- Conference Paper
- Langue
- English
- Mot clé (fr)
- Ajustement File attente Mémoire tampon Structure mémoire Triage
- Mot clé (en)
- Fitting Queue Buffer memory Storage structure Sorting
- Mot clé (es)
- Ajuste Fila espera Memoria tampón Estructura memoria Tría
- Classification
- Pascal
- 001 Sciences exactes et technologie / 001D Sciences appliquees / 001D02 Informatique; automatique theorique; systemes / 001D02A Informatique théorique / 001D02A05 Algorithmique. Calculabilité. Arithmétique ordinateur
- Pascal
- 001 Sciences exactes et technologie / 001D Sciences appliquees / 001D02 Informatique; automatique theorique; systemes / 001D02B Logiciel / 001D02B10 Performances des systèmes informatiques. Fiabilité
- Discipline
- Computer science : theoretical automation and systems
- Provenance
- Inist-CNRS
- Base de données
- PASCAL
- Identifiant INIST
- 1899808
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Accès au Document
Installer sur votre navigateur
DOI
10.1016/S0304-3975(99)00006-7 
https://dx.doi.org/10.1016/S0304-3975(99)00006-7
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1016\/S0304-3975(99)00006-7\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:39:\"Heaps and heapsort on secondary storage\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:3:\"220\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"345\";s:8:\"\u0000*\u0000epage\";s:3:\"362\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"FADEL\";s:10:\"\u0000*\u0000aufirst\";s:1:\"R\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:14:\"JAKOBSEN, K. V\";i:1;s:13:\"KATAJAINEN, J\";i:2;s:10:\"TEUHOLA, J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:29:\"Australasian Computer Science\";s:8:\"\u0000*\u0000title\";s:39:\"Heaps and heapsort on secondary storage\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Accès par Panist
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1016\/S0304-3975(99)00006-7\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:39:\"Heaps and heapsort on secondary storage\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:3:\"220\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"345\";s:8:\"\u0000*\u0000epage\";s:3:\"362\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"FADEL\";s:10:\"\u0000*\u0000aufirst\";s:1:\"R\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:14:\"JAKOBSEN, K. V\";i:1;s:13:\"KATAJAINEN, J\";i:2;s:10:\"TEUHOLA, J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:29:\"Australasian Computer Science\";s:8:\"\u0000*\u0000title\";s:39:\"Heaps and heapsort on secondary storage\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Accès par Istex
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:29:\"10.1016\/S0304-3975(99)00006-7\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Accès par Unpaywall
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1016\/S0304-3975(99)00006-7\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:39:\"Heaps and heapsort on secondary storage\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:3:\"220\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"345\";s:8:\"\u0000*\u0000epage\";s:3:\"362\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"FADEL\";s:10:\"\u0000*\u0000aufirst\";s:1:\"R\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:14:\"JAKOBSEN, K. V\";i:1;s:13:\"KATAJAINEN, J\";i:2;s:10:\"TEUHOLA, J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:29:\"Australasian Computer Science\";s:8:\"\u0000*\u0000title\";s:39:\"Heaps and heapsort on secondary storage\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Accès par Europe PubMed Central
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1016\/S0304-3975(99)00006-7\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:39:\"Heaps and heapsort on secondary storage\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:3:\"220\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"345\";s:8:\"\u0000*\u0000epage\";s:3:\"362\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"FADEL\";s:10:\"\u0000*\u0000aufirst\";s:1:\"R\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:14:\"JAKOBSEN, K. V\";i:1;s:13:\"KATAJAINEN, J\";i:2;s:10:\"TEUHOLA, J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:29:\"Australasian Computer Science\";s:8:\"\u0000*\u0000title\";s:39:\"Heaps and heapsort on secondary storage\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Accès par Base Search
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:29:\"10.1016\/S0304-3975(99)00006-7\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:39:\"Heaps and heapsort on secondary storage\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:3:\"220\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"345\";s:8:\"\u0000*\u0000epage\";s:3:\"362\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"FADEL\";s:10:\"\u0000*\u0000aufirst\";s:1:\"R\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:14:\"JAKOBSEN, K. V\";i:1;s:13:\"KATAJAINEN, J\";i:2;s:10:\"TEUHOLA, J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:29:\"Australasian Computer Science\";s:8:\"\u0000*\u0000title\";s:39:\"Heaps and heapsort on secondary storage\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Accès par arXiv
