Die bibliographische Datenbank LEABib

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

Suche: Booktitle=Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory, SWAT'90 (Bergen, Norway, July 11-14, 1990)

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

Structural complexity theory: Recent surprises
Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi
Lecture Notes in Computer Science 447, 1990, pp. 1-12
Approximating maximum independent sets by excluding subgraphs
Ravi Boppana, Magnús M. Halldórsson
Lecture Notes in Computer Science 447, 1990, pp. 13-25
Generating sparse spanners for weighted graphs
Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph
Lecture Notes in Computer Science 447, 1990, pp. 26-37
Finding the k smallest spanning trees
David Eppstein
Lecture Notes in Computer Science 447, 1990, pp. 38-47
The file distribution problem for processor networks
Goos Kant, Jan van Leeuwen
Lecture Notes in Computer Science 447, 1990, pp. 48-59
Translating polygons with applications to hidden surface removal
Mark de Berg
Lecture Notes in Computer Science 447, 1990, pp. 60-70
Output-sensitive generation of the perspective view of isothetic parallelepipeds
Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec
Lecture Notes in Computer Science 447, 1990, pp. 71-84
Graphics in flatland revisited
Michel Pocchiola
Lecture Notes in Computer Science 447, 1990, pp. 85-96
The visibility diagram: A data structure for visibility problems and motion planning
Gert Vegter
Lecture Notes in Computer Science 447, 1990, pp. 97-110
Fast updating of well-balanced trees
Arne Andersson, Tony W. Lai
Lecture Notes in Computer Science 447, 1990, pp. 111-121
How to update a balanced binary tree with a constant number of rotations
Thomas Ottmann, Derick Wood
Lecture Notes in Computer Science 447, 1990, pp. 122-131
Ranking trees generated by rotations
W. Samuel Bent
Lecture Notes in Computer Science 447, 1990, pp. 132-142
Expected behaviour analysis of AVL trees
Ricardo Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani
Lecture Notes in Computer Science 447, 1990, pp. 143-159
Analysis of the expected search cost in skip lists
Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
Lecture Notes in Computer Science 447, 1990, pp. 160-172
Lower bounds for monotonic list labeling
Paul F. Dietz, Ju Zhang
Lecture Notes in Computer Science 447, 1990, pp. 173-180
Sorting shuffled monotone sequences
Christos Levcopoulos, Ola Petersson
Lecture Notes in Computer Science 447, 1990, pp. 181-191
A faster parallel algorithm for a matrix searching problem
Mikhail J. Atallah
Lecture Notes in Computer Science 447, 1990, pp. 192-200
A rectilinear Steiner minimal tree algorithm for convex point sets
Dana S. Richards, Jeffrey S. Salowe
Lecture Notes in Computer Science 447, 1990, pp. 201-212
Finding shortest paths in the presence of orthogonal obstacles using a combined L_1 and link metric
Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
Lecture Notes in Computer Science 447, 1990, pp. 213-224
Input-sensitive compliant motion in the plane
Joseph Friedman, John Hershberger, Jack Snoeyink
Lecture Notes in Computer Science 447, 1990, pp. 225-237
Fast algorithms for greedy triangulation
Christos Levcopoulos, Andrzej Lingas
Lecture Notes in Computer Science 447, 1990, pp. 238-250
Star unfolding of a polytope with applications
Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon
Lecture Notes in Computer Science 447, 1990, pp. 251-263
Space-sweep algorithms for parametric optimization
David Fernández-Baca
Lecture Notes in Computer Science 447, 1990, pp. 264-275
Approximating finite weighted point sets by hyperplanes
N.M. Korneenko, H. Martini
Lecture Notes in Computer Science 447, 1990, pp. 276-286
Data structures for Traveling Salesmen
David S. Johnson
Lecture Notes in Computer Science 447, 1990, pp. 287-287

Seiten 1 2 >