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=1097
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A fast heuristic for approximating the minimum weight triangulation
Christos Levcopoulos
,
Drago Krznaric
Lecture Notes in Computer Science
1097
, 1996, pp. 296-308
Neighbours on a grid
Andrej Brodnik
,
J. Ian Munro
Lecture Notes in Computer Science
1097
, 1996, pp. 309-320
On two dimensional packing
Yossi Azar
,
Leah Epstein
Lecture Notes in Computer Science
1097
, 1996, pp. 321-332
Optimal orthogonal drawings of triconnected plane graphs
Therese C. Biedl
Lecture Notes in Computer Science
1097
, 1996, pp. 333-344
Walking streets faster
Alejandro López-Ortiz
,
Sven Schuierer
Lecture Notes in Computer Science
1097
, 1996, pp. 345-356
Safe and efficient traffic laws for mobile robots
Sonne Preminger
,
Eli Upfal
Lecture Notes in Computer Science
1097
, 1996, pp. 357-367
Progress in selection
Mike Paterson
Lecture Notes in Computer Science
1097
, 1996, pp. 368-379
Probabilistic ancestral sequences and multiple alignments
Gaston H. Gonnet
,
Steven A. Benner
Lecture Notes in Computer Science
1097
, 1996, pp. 380-391
Efficient algorithms for Lempel-Ziv encoding
Leszek Ga̧sieniec
,
Marek Karpinski
,
Wojciech Plandowski
,
Wojciech Rytter
Lecture Notes in Computer Science
1097
, 1996, pp. 392-403
The deterministic complexity of parallel multisearch
Armin Bäumker
,
Wolfgang Dittrich
,
Andrea Pietracaprina
Lecture Notes in Computer Science
1097
, 1996, pp. 404-415
Priority queues on parallel machines
Gerth Stlting Brodal
Lecture Notes in Computer Science
1097
, 1996, pp. 416-427
Binary search trees: How low can you go?
Rolf Fagerberg
Lecture Notes in Computer Science
1097
, 1996, pp. 428-439
Boolean analysis of incomplete examples
Endre Boros
,
Toshihide Ibaraki
,
Kazuhisa Makino
Lecture Notes in Computer Science
1097
, 1996, pp. 440-451
Seiten
<
1
2