Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1533

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

The discrepancy method
Bernard Chazelle
Lecture Notes in Computer Science 1533, 1998, pp. 1-3
Implementing algorithms and data structures: An educational and research perspective
Roberto Tamassia
Lecture Notes in Computer Science 1533, 1998, pp. 4-8
L_{\infty} Voronoi diagrams and applications to VLSI layout and manufacturing
Evanthia Papadopoulou
Lecture Notes in Computer Science 1533, 1998, pp. 9-18
Facility location on terrains
Boris Aronov, Marc van Kreveld, René van Oostrum, Kasturirangan Varadarajan
Lecture Notes in Computer Science 1533, 1998, pp. 19-28
Computing weighted rectilinear median and center set in the presence of obstacles
Joonsoo Choi, Chan-Su Shin, Sung Kwon Kim
Lecture Notes in Computer Science 1533, 1998, pp. 29-38
Maximizing agreement with a classification by bounded or unbounded number of associated words
Hiroki Arimura, Shinichi Shimozono
Lecture Notes in Computer Science 1533, 1998, pp. 39-48
Disjunctions of Horn theories and their cores
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
Lecture Notes in Computer Science 1533, 1998, pp. 49-58
Checking programs discreetly: Demonstrating result-correctness efficiently while concealing it
Giovanni di Crescenzo, Kouichi Sakurai, Moti Yung
Lecture Notes in Computer Science 1533, 1998, pp. 59-68
Two-layer planarization in graph drawing
Petra Mutzel, René Weiskircher
Lecture Notes in Computer Science 1533, 1998, pp. 69-78
Computing orthogonal drawings in a variable embedding setting
Walter Didimo, Giuseppe Liotta
Lecture Notes in Computer Science 1533, 1998, pp. 79-88
Dynamic grid embedding with few bends and changes
Ulrik Brandes, Dorothea Wagner
Lecture Notes in Computer Science 1533, 1998, pp. 89-98
Two new families of list update algorithms
Frank Schulz
Lecture Notes in Computer Science 1533, 1998, pp. 99-108
An optimal algorithm for on-line palletizing at delivery industry
J. Rethmann, E. Wanke
Lecture Notes in Computer Science 1533, 1998, pp. 109-118
On-line scheduling of parallel jobs with runtime restrictions
Stefan Bischof, Ernst W. Mayr
Lecture Notes in Computer Science 1533, 1998, pp. 119-128
Testing the quality of manufactured disks and cylinders
Prosenjit Bose, Pat Morin
Lecture Notes in Computer Science 1533, 1998, pp. 129-138
Casting with skewed ejection direction
Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong
Lecture Notes in Computer Science 1533, 1998, pp. 139-148
Repairing flaws in a picture based on a geometric representation of a digital image
Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu
Lecture Notes in Computer Science 1533, 1998, pp. 149-158
k-edge and 3-vertex connectivity augmentation in an arbitrary multigraph
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
Lecture Notes in Computer Science 1533, 1998, pp. 159-168
Polyhedral structure of submodular and posi-modular systems
Hiroshi Nagamochi, Toshihide Ibaraki
Lecture Notes in Computer Science 1533, 1998, pp. 169-178
Maximizing the number of connections in optical tree networks
Thomas Erlebach, Klaus Jansen
Lecture Notes in Computer Science 1533, 1998, pp. 179-188
Selecting the k largest elements with parity tests
Tak Wah Lam, Hing Fung Ting
Lecture Notes in Computer Science 1533, 1998, pp. 189-198
Randomized K-dimensional binary search trees
Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez
Lecture Notes in Computer Science 1533, 1998, pp. 199-208
Randomized O(\log\log n)-round leader election protocols in packet radio networks
Koji Nakano, Stephan Olariu
Lecture Notes in Computer Science 1533, 1998, pp. 209-218
Random regular graphs with edge faults: Expansion through cores
Andreas Goerdt
Lecture Notes in Computer Science 1533, 1998, pp. 219-228
A quantum polynomial time algorithm in worst case for Simon's problem
Takashi Mihara, Shao Chin Sung
Lecture Notes in Computer Science 1533, 1998, pp. 229-236

Seiten 1 2 >