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=979
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Load balancing for response time
Jeffery Westbrook
Lecture Notes in Computer Science
979
, 1995, pp. 355-368
Self-simulation for the Passive Optical Star Model
P. Berthomé
,
Th. Duboux
,
T. Hagerup
,
I. Newman
,
A. Schuster
Lecture Notes in Computer Science
979
, 1995, pp. 369-380
Computing the agreement of trees with bounded degrees
Martin Farach
,
Teresa M. Przytycka
,
Mikkel Thorup
Lecture Notes in Computer Science
979
, 1995, pp. 381-393
Approximation algorithms for feasible cut and multicut problems
Bo Yu
,
Joseph Cheriyan
Lecture Notes in Computer Science
979
, 1995, pp. 394-408
On parallel versus sequential approximation
Maria Serna
,
Fatos Xhafa
Lecture Notes in Computer Science
979
, 1995, pp. 409-419
An efficient and effective approximation algorithm for the Map Labeling Problem
Frank Wagner
,
Alexander Wolff
Lecture Notes in Computer Science
979
, 1995, pp. 420-433
Approximating the bandwidth for asteroidal triple-free graphs
T. Kloks
,
D. Kratsch
,
H. Müller
Lecture Notes in Computer Science
979
, 1995, pp. 434-447
Near-optimal distributed edge coloring
Devdatt Dubhashi
,
Alessandro Panconesi
Lecture Notes in Computer Science
979
, 1995, pp. 448-459
The centroid of points with approximate weights
Marshall Bern
,
David Eppstein
,
Leonidas Guibas
,
John Hershberger
,
Subhash Suri
,
Jan Wolter
Lecture Notes in Computer Science
979
, 1995, pp. 460-472
0/1
-integer programming: Optimization and augmentation are equivalent
Andreas S. Schulz
,
Robert Weismantel
,
Günter M. Ziegler
Lecture Notes in Computer Science
979
, 1995, pp. 473-483
The online transportation problem
Bala Kalyanasundaram
,
Kirk R. Pruhs
Lecture Notes in Computer Science
979
, 1995, pp. 484-493
A polyhedral approach to planar augmentation and related problems
Petra Mutzel
Lecture Notes in Computer Science
979
, 1995, pp. 494-507
Optimal layouts on a chain ATM network
Ornan Gerstel
,
Avishai Wool
,
Shmuel Zaks
Lecture Notes in Computer Science
979
, 1995, pp. 508-522
Efficient dynamic-resharing "Verifiable Secret Sharing" against mobile adversary
Noga Alon
,
Zvi Galil
,
Moti Yung
Lecture Notes in Computer Science
979
, 1995, pp. 523-537
Adaptive video on demand
Sudhanshu Aggarwal
,
Juan A. Garay
,
Amir Herzberg
Lecture Notes in Computer Science
979
, 1995, pp. 538-553
The binomial transform and its application to the analysis of skip lists
Patricio V. Poblete
,
J. Ian Munro
,
Thomas Papadakis
Lecture Notes in Computer Science
979
, 1995, pp. 554-569
An optimal parallel algorithm for digital curve segmentation using Hough polygons and monotone function search
Peter Damaschke
Lecture Notes in Computer Science
979
, 1995, pp. 570-581
Fast skeleton construction
Rolf Klein
,
Andrzej Lingas
Lecture Notes in Computer Science
979
, 1995, pp. 582-595
Seiten
<
1
2