Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=450

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

Recent progress in string algorithms
Zvi Galil
Lecture Notes in Computer Science 450, 1990, pp. 1-1
Selection networks
Nicholas Pippenger
Lecture Notes in Computer Science 450, 1990, pp. 2-11
Computing edge-connectivity in multiple and capacitated graphs
Hiroshi Nagamochi, Toshihide Ibaraki
Lecture Notes in Computer Science 450, 1990, pp. 12-20
Efficient sequential and parallel algorithms for planar minimum cost flow
Hiroshi Imai, Kazuo Iwano
Lecture Notes in Computer Science 450, 1990, pp. 21-30
Structural analyses on the complexity of inverting functions
Osamu Watanabe, Seinosuke Toda
Lecture Notes in Computer Science 450, 1990, pp. 31-38
Oracles versus proof techniques that do not relativize
Eric Allender
Lecture Notes in Computer Science 450, 1990, pp. 39-52
20-relative neighborhood graphs are Hamiltonian
Maw Shang Chang, C.Y. Tang, R.C.T. Lee
Lecture Notes in Computer Science 450, 1990, pp. 53-65
The k-Gabriel graphs and their applications
Tung-Hsin Su, Ruei-Chuan Chang
Lecture Notes in Computer Science 450, 1990, pp. 66-75
Parallel algorithms for generating subsets and set partitions
Borivoje Djokić, Masahiro Miyakawa, Satoshi Sekiguchi, Ichiro Semba, Ivan Stojmenović
Lecture Notes in Computer Science 450, 1990, pp. 76-85
Parallel algorithms for linked list and beyond
Yijie Han
Lecture Notes in Computer Science 450, 1990, pp. 86-100
Local tournaments and proper circular arc graphs
Pavol Hell, Jrgen Bang-Jensen, Jing Huang
Lecture Notes in Computer Science 450, 1990, pp. 101-108
Fast algorithms for the dominating set problem on permutation graphs
Kuo-Hui Tsai, Wen-Lian Hsu
Lecture Notes in Computer Science 450, 1990, pp. 109-117
Two probabilistic results on merging
Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
Lecture Notes in Computer Science 450, 1990, pp. 118-127
Randomized broadcast in networks
Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
Lecture Notes in Computer Science 450, 1990, pp. 128-137
On the construction of abstract Voronoi diagrams, II
R. Klein, K. Mehlhorn, S. Meiser
Lecture Notes in Computer Science 450, 1990, pp. 138-154
Searching in higher dimension
Bernard Chazelle
Lecture Notes in Computer Science 450, 1990, pp. 155-155
Finding extrema with unary predicates
David G. Kirkpatrick, Feng Gao
Lecture Notes in Computer Science 450, 1990, pp. 156-164
Implicitly searching convolutions and computing depth of collision
David Dobkin, John Hershberger, David Kirkpatrick, Subhash Suri
Lecture Notes in Computer Science 450, 1990, pp. 165-180
Characterization for a family of infinitely many irreducible equally spaced polynomials
Toshiya Itoh
Lecture Notes in Computer Science 450, 1990, pp. 181-190
Distributed algorithms for deciphering
Michel Cosnard, Jean-Laurent Philippe
Lecture Notes in Computer Science 450, 1990, pp. 191-200
An efficient algorithm for optimal loop parallelization
Kazuo Iwano, Susan Yeh
Lecture Notes in Computer Science 450, 1990, pp. 201-210
Another view on the SSS* algorithm
Wim Pijls, Arie de Bruin
Lecture Notes in Computer Science 450, 1990, pp. 211-220
Algorithms from complexity theory: Polynomial-time operations for complex sets
Lane A. Hemachandra
Lecture Notes in Computer Science 450, 1990, pp. 221-231
Complexity cores and hard problem instances
Uwe Schöning
Lecture Notes in Computer Science 450, 1990, pp. 232-240
Spatial point location and its applications
Xue-Hou Tan, Tomio Hirata, Yasuyoshi Inagaki
Lecture Notes in Computer Science 450, 1990, pp. 241-250

Seiten 1 2 >