Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Series=LNCS AND Volume=955
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounds to processor-time tradeoffs under bounded speed message propagation
Gianfranco Bilardi
,
Franco P. Preparata
Lecture Notes in Computer Science
955
, 1995, pp. 1-12
The two-line center problem from a polar view: A new algorithm and data structure
Jerzy W. Jaromczyk
,
Miroslaw Kowaluk
Lecture Notes in Computer Science
955
, 1995, pp. 13-25
On some geometric selection and optimization problems via sorted matrices
Alex Glozman
,
Klara Kedem
,
Gregory Shpitalnik
Lecture Notes in Computer Science
955
, 1995, pp. 26-37
Load balancing in quorum systems
Ron Holzman
,
Yosi Marcus
,
David Peleg
Lecture Notes in Computer Science
955
, 1995, pp. 38-49
Balanced distributed search trees do not exist
Brigitte Kröll
,
Peter Widmayer
Lecture Notes in Computer Science
955
, 1995, pp. 50-61
Two-floodlight illumination of convex polygons
V. Estivill Castro
,
Jorge Urrutia
Lecture Notes in Computer Science
955
, 1995, pp. 62-73
On the complexity of approximating and illummating three-dimensional convex polyhedra
Gautam Das
,
Michael T. Goodrich
Lecture Notes in Computer Science
955
, 1995, pp. 74-85
Scheduling jobs that arrive over time
Cynthia Phillips
,
Clifford Stein
,
Joel Wein
Lecture Notes in Computer Science
955
, 1995, pp. 86-97
Dynamic algorithms for the Dyck languages
Gudmund Skovbjerg Frandsen
,
Thore Husfeldt
,
Peter Bro Miltersen
,
Theis Rauhe
,
Sren Skyum
Lecture Notes in Computer Science
955
, 1995, pp. 98-108
Arrangements in higher dimensions: Voronoi diagrams, motion planning and other applications
Micha Sharir
Lecture Notes in Computer Science
955
, 1995, pp. 109-121
Computing a shortest watchman path in a simple polygon in polynomial-time
Svante Carlsson
,
Håkan Jonsson
Lecture Notes in Computer Science
955
, 1995, pp. 122-134
Going home through an unknown street
Alejandro López-Ortiz
,
Sven Schuierer
Lecture Notes in Computer Science
955
, 1995, pp. 135-146
Page migration with limited local memory capacity
Susanne Albers
,
Hisashi Koga
Lecture Notes in Computer Science
955
, 1995, pp. 147-158
Randomized algorithms for metrical task systems
Sandy Irani
,
Steve Seiden
Lecture Notes in Computer Science
955
, 1995, pp. 159-170
Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining
Prosenjit Gupta
,
Ravi Janardan
,
Jayanth Majhi
,
Tony Woo
Lecture Notes in Computer Science
955
, 1995, pp. 171-182
Computing common tangents without a separating line
David Kirkpatrick
,
Jack Snoeyink
Lecture Notes in Computer Science
955
, 1995, pp. 183-193
Online perfect matching and mobile computing
Edward F. Grove
,
Ming-Yang Kao
,
P. Krishnan
,
Jeffrey Scott Vitter
Lecture Notes in Computer Science
955
, 1995, pp. 194-205
Competitive algorithms for the on-line traveling salesman
Giorgio Ausiello
,
Esteban Feuerstein
,
Stefano Leonardi
,
Leen Stougie
,
Maurizio Talamo
Lecture Notes in Computer Science
955
, 1995, pp. 206-217
Quadrangulations of planar sets
Godfried Toussaint
Lecture Notes in Computer Science
955
, 1995, pp. 218-227
A linear-time construction of the relative neighborhood graph within a histogram
Andrzej Lingas
,
Asish Mukhopadhyay
Lecture Notes in Computer Science
955
, 1995, pp. 228-238
Computing proximity drawings of trees in the 3-dimemsional space
Giuseppe Liotta
,
Giuseppe Di Battista
Lecture Notes in Computer Science
955
, 1995, pp. 239-250
Routing on trees via matchings
Alan Roberts
,
Antonis Symvonis
,
Louxin Zhang
Lecture Notes in Computer Science
955
, 1995, pp. 251-262
A ranking algorithm for Hamilton paths in shuffle-exchange graphs
Fred S. Annexstein
,
Eugene A. Kuchko
Lecture Notes in Computer Science
955
, 1995, pp. 263-269
Amortization results for chromatic search trees, with an application to priority queues
Joan Boyar
,
Rolf Fagerberg
,
Kim S. Larsen
Lecture Notes in Computer Science
955
, 1995, pp. 270-281
Fast meldable priority queues
Gerth Stlting Brodal
Lecture Notes in Computer Science
955
, 1995, pp. 282-290
Seiten 1
2
>