Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=382

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

Parallel algorithms for the subgraph homeomorphism problem
Samir Khuller
Lecture Notes in Computer Science 382, 1989, pp. 303-315
Galleries, light matchings and visibility graphs
Jurek Czyzowicz, Ivan Rival, Jorge Urrutia
Lecture Notes in Computer Science 382, 1989, pp. 316-324
Weighted visibility graphs of bars and related flow problems
David G. Kirkpatrick, Stephen K. Wismath
Lecture Notes in Computer Science 382, 1989, pp. 325-334
Parallel algorithms for cographs: Recognition and applications
Gur Saran Adhar, Shietung Peng
Lecture Notes in Computer Science 382, 1989, pp. 335-351
Dynamic data structures for series parallel digraphs
Giuseppe F. Italiano, Alberto Marchetti Spaccamela, Umberto Nanni
Lecture Notes in Computer Science 382, 1989, pp. 352-372
Motion planning in the CL-environment
Chee-Keng Yap, Helmut Alt
Lecture Notes in Computer Science 382, 1989, pp. 373-380
Self-adjusting k-ary search trees
Murray Sherk
Lecture Notes in Computer Science 382, 1989, pp. 381-392
Improving partial rebuilding by using simple balance criteria
Arne Andersson
Lecture Notes in Computer Science 382, 1989, pp. 393-402
An efficient all-parses systolic algorithm for general context-free parsing
Oscar H. Ibarra, Michael A. Palis
Lecture Notes in Computer Science 382, 1989, pp. 403-419
A polynomial time algorithm for the local testability problem of deterministic finite automata
Sam Kim, Robert McNaughton, Robert McCloskey
Lecture Notes in Computer Science 382, 1989, pp. 420-436
Skip lists: A probabilistic alternative to balanced trees
William Pugh
Lecture Notes in Computer Science 382, 1989, pp. 437-449
A fast algorithm for melding splay trees
Graeme Port, Alistair Moffat
Lecture Notes in Computer Science 382, 1989, pp. 450-459
An efficient algorithm for finding all maximal square blocks in a matrix
Heinz Breu
Lecture Notes in Computer Science 382, 1989, pp. 460-471
Complexity issues in tree-based version control
Naomi Nishimura
Lecture Notes in Computer Science 382, 1989, pp. 472-486
Structured NC
Bertha Scholten, Jan van Leeuwen
Lecture Notes in Computer Science 382, 1989, pp. 487-498
Heapsort - Adapted for presorted files
Christos Levcopoulos, Ola Petersson
Lecture Notes in Computer Science 382, 1989, pp. 499-509
The distribution of keys in a binary heap
Mark Allen Weiss, Jainendra K. Navlakha
Lecture Notes in Computer Science 382, 1989, pp. 510-516
Optimal hypercube algorithms for labeled images
Russ Miller, Quentin F. Stout
Lecture Notes in Computer Science 382, 1989, pp. 517-528
On the complexity of single row routing problems
I. Hal Sudborough
Lecture Notes in Computer Science 382, 1989, pp. 529-540
A new search time update time tradeoff for the implicit dictionary
Philippe Derome
Lecture Notes in Computer Science 382, 1989, pp. 541-551
Sorting with minimum data movement
J. Ian Munro, Venkatesh Raman
Lecture Notes in Computer Science 382, 1989, pp. 552-562
Augmentation problems on hierarchically defined graphs
David Fernández-Baca, Mark A. Williams
Lecture Notes in Computer Science 382, 1989, pp. 563-576
On linear time minor tests and depth first search
Hans L. Bodlaender
Lecture Notes in Computer Science 382, 1989, pp. 577-590
Combinatorial and computational results for line arrangements in space
Herbert Edelsbrunner
Lecture Notes in Computer Science 382, 1989, pp. 591-591

Seiten < 1 2