Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=1136

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Analysis of shellsort and related algorithms
Robert Sedgewick
Lecture Notes in Computer Science 1136, 1996, pp. 1-11
Drawing with colors
Ashim Garg, Roberto Tamassia, Paola Vocca
Lecture Notes in Computer Science 1136, 1996, pp. 12-26
Approximating the unsatisfiability threshold of random formulas
Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc
Lecture Notes in Computer Science 1136, 1996, pp. 27-38
Preemptive weighted completion time scheduling of parallel jobs
Uwe Schwiegelshohn
Lecture Notes in Computer Science 1136, 1996, pp. 39-51
Approximation algorithms for dynamic storage allocation
Jordan Gergov
Lecture Notes in Computer Science 1136, 1996, pp. 52-61
Positive linear programming, parallel approximation and PCP's
Luca Trevisan
Lecture Notes in Computer Science 1136, 1996, pp. 62-75
Scheduling jobs with communication delays: Using infeasible solutions for approximation
Rolf H. Möhring, Markus W. Schäffter, Andreas S. Schulz
Lecture Notes in Computer Science 1136, 1996, pp. 76-90
Randomization of search trees by subtree size
Salvador Roura, Conrado Martínez
Lecture Notes in Computer Science 1136, 1996, pp. 91-106
Efficient dynamic method-lookup for object oriented languages
Paolo Ferragina, S. Muthukrishnan
Lecture Notes in Computer Science 1136, 1996, pp. 107-120
Priority queues: Small, monotone and trans-dichotomous
Rajeev Raman
Lecture Notes in Computer Science 1136, 1996, pp. 121-137
Simulated annealing and its problems to color graphs
Andreas Nolte, Rainer Schrader
Lecture Notes in Computer Science 1136, 1996, pp. 138-151
The capacitated K-center problem
Samir Khuller, Yoram J. Sussmann
Lecture Notes in Computer Science 1136, 1996, pp. 152-166
A unified local ratio approximation of node-deletion problems
Toshihiro Fujito
Lecture Notes in Computer Science 1136, 1996, pp. 167-178
Approximation algorithms for connected dominating sets
Sudipto Guha, Samir Khuller
Lecture Notes in Computer Science 1136, 1996, pp. 179-193
Greedy algorithms for the shortest common superstring that are asymptotically optimal
Alan Frieze, Wojciech Szpankowski
Lecture Notes in Computer Science 1136, 1996, pp. 194-207
On the depth of randomly generated circuits
Tatsuie Tsukiji, Fatos Xhafa
Lecture Notes in Computer Science 1136, 1996, pp. 208-220
The analysis of linear probing hashing with buckets
Alfredo Viola, Patricio V. Poblete
Lecture Notes in Computer Science 1136, 1996, pp. 221-233
Parallel algorithms for partitioning sorted sets and related problems
Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi
Lecture Notes in Computer Science 1136, 1996, pp. 234-245
Fast generation of random permutations via networks simulation
Artur Czumaj, Przemysƚawa Kanarek, Mirosƚaw Kutyƚowski, Krzysztof Loryś
Lecture Notes in Computer Science 1136, 1996, pp. 246-260
On the parallel dynamic dictionary matching problem: New results with applications
Paolo Ferragina, Fabrizio Luccio
Lecture Notes in Computer Science 1136, 1996, pp. 261-275
Parallel algorithms for series parallel graphs
Hans L. Bodlaender, Babette de Fluiter
Lecture Notes in Computer Science 1136, 1996, pp. 277-289
Parallel complexity of householder QR factorization
Mauro Leoncini, Giovanni Manzini, Luciano Margara
Lecture Notes in Computer Science 1136, 1996, pp. 290-301
Reporting red-blue intersections between two sets of connected line segments
Julien Basch, Leonidas J. Guibas, G.D. Ramkumar
Lecture Notes in Computer Science 1136, 1996, pp. 302-319
Matching convex shapes with respect to the symmetric difference
Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
Lecture Notes in Computer Science 1136, 1996, pp. 320-333
On minimum-area hulls
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S.B. Mitchell, Vera Sacristan, Steven S. Skiena, Tae-Cheon Yang
Lecture Notes in Computer Science 1136, 1996, pp. 334-348

Seiten 1 2 >