| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISOBE600200054029 |
|
|
Titolo |
1: Cronologia e istituzioni |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Napoli : Vincenzo Pezzuti, 1856 |
|
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
|
|
|
|
|
2. |
Record Nr. |
UNISA996465617903316 |
|
|
Titolo |
Algorithm engineering : 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 : proceedings / / Jeffrey S. Vitter, Christos D. Zaroliagis, editors |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Germany ; ; New York, New York : , : Springer, , [1999] |
|
©1999 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1999.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (VIII, 368 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 1668 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer algorithms |
Software engineering |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
"This volume contains the papers accepted for presentation at the 3rd International Workshop on Algorithm Engineering (WAE'99) held in London, UK, on July 19-21, 1999"--Introd. |
|
|
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Invited Lectures -- Selecting Problems for Algorithm Evaluation -- BSP Algorithms — “Write Once, Run Anywhere” -- Ten Years of LEDA: Some Thoughts -- Contributed Papers -- Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison -- Efficient |
|
|
|
|
|
|
|
|
|
|
Implementation of Lazy Suffix Trees -- Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism -- Finding Minimum Congestion Spanning Trees -- Evaluation of an Algorithm for the Transversal Hypergraph Problem -- Construction Heuristics and Domination Analysis for the Asymmetric TSP -- Counting in Mobile Networks: Theory and Experimentation -- Dijkstra’s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport -- Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA -- On-Line Zone Construction in Arrangements of Lines in the Plane -- The Design and Implementation of Planar Maps in CGAL -- An Easy to Use Implementation of Linear Perturbations within Cupgal -- Analysing Cache Effects in Distribution Sorting -- Fast Regular Expression Search -- An Experimental Evaluation of Hybrid Data Structures for Searching -- LEDA-SM: Extending LEDA to Secondary Memory -- A Priority Queue Transform -- Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks -- Estimating Large Distances in Phylogenetic Reconstruction -- The Performance of Concurrent Red-Black Tree Algorithms -- Performance Engineering Case Study: Heap Construction -- A Fast and Simple Local Search for Graph Coloring -- BALL: Biochemical Algorithms Library -- An Experimental Study of Priority Queues in External Memory. |
|
|
|
|
|
|
|
|
|
|
|
|
|
3. |
Record Nr. |
UNISOBE600200023347 |
|
|
Titolo |
Brecht-Handbuch in fünf Bänden. Band [I]: Stücke. Band II: Gedichte. Band III: Prosa, Filme, Drehbücher. Band IV: Schriften, Journale, Briefe. Band V: Register, Chronik, Materialien / hrsg. Jan Knopf ; wissenschftliche Redaktion: Joachim Lucchesi |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Stuttgart-Weimar, : J.B. Metzler Verlag, 2003 |
|
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
| |