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
Hilfe
Suche: Series=LNCS AND YEAR=1992
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of dataflow analysis of logic programs
Saumya K. Debray
Lecture Notes in Computer Science
623
, 1992, pp. 509-520
Comparison of abstract interpretations
Agostino Cortesi
,
Gilberto Filè
,
William Winsborough
Lecture Notes in Computer Science
623
, 1992, pp. 521-532
Timing Petri nets categorically
Carolyn Brown
,
Doug Gurr
Lecture Notes in Computer Science
623
, 1992, pp. 571-582
Asynchronous cellular automata for infinite traces
Paul Gastin
,
Antoine Petit
Lecture Notes in Computer Science
623
, 1992, pp. 583-594
A trace semantics for Petri nets
P.W. Hoogers
,
H.C.M. Kleijn
,
P.S. Thiagarajan
Lecture Notes in Computer Science
623
, 1992, pp. 595-604
Proved trees
Pierpaolo Degano
,
Corrado Priami
Lecture Notes in Computer Science
623
, 1992, pp. 629-640
Program composition via unification
Limor Fix
,
Nissim Francez
,
Orna Grumberg
Lecture Notes in Computer Science
623
, 1992, pp. 672-684
Testing preorders for probabilistic processes
Rance Cleaveland
,
Scott A. Smolka
,
Amy Zwarico
Lecture Notes in Computer Science
623
, 1992, pp. 708-719
Efficient two-dimensional searching
Gaston H. Gonnet
Lecture Notes in Computer Science
621
, 1992, pp. 317
Direct bulk-synchronous parallel algorithms
Alexandros V. Gerbessiotis
,
Leslie G. Valiant
Lecture Notes in Computer Science
621
, 1992, pp. 1-18
Memory limited inductive inference machines
Rūsiņs̆ Freivalds
,
Carl H. Smith
Lecture Notes in Computer Science
621
, 1992, pp. 19-29
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
Faith Fich
,
Miroslaw Kowaluk
,
Krzysztof Loryś
,
Miroslaw Kutyƚowski
,
Prabhakar Ragde
Lecture Notes in Computer Science
621
, 1992, pp. 30-41
An optimal parallel algorithm for computing a near-optimal order of matrix multiplications
Artur Czumaj
Lecture Notes in Computer Science
621
, 1992, pp. 62-72
Low-diameter graph decomposition is in NC
Baruch Awerbuch
,
Bonnie Berger
,
Lenore Cowen
,
David Peleg
Lecture Notes in Computer Science
621
, 1992, pp. 83-93
Parallel algorithm for cograph recognition with applications
Xin He
Lecture Notes in Computer Science
621
, 1992, pp. 94-105
Parallel algorithms for all minimum link paths and link center problems
Subir Kumar Ghosh
,
Anil Maheshwari
Lecture Notes in Computer Science
621
, 1992, pp. 106-117
Heap construction in the parallel comparison tree model
Paul F. Dietz
Lecture Notes in Computer Science
621
, 1992, pp. 140-150
Efficient rebalancing of chromatic search trees
Joan Boyar
,
Kim S. Larsen
Lecture Notes in Computer Science
621
, 1992, pp. 151-164
G
K
D-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
Walter Cunto
,
Vicente Yriarte
Lecture Notes in Computer Science
621
, 1992, pp. 192-211
Dynamic 2- and 3-connectivity on planar graphs
Dora Giammarresi
,
Giuseppe F. Italiano
Lecture Notes in Computer Science
621
, 1992, pp. 221-232
Fully dynamic 2-edge-connectivity in planar graphs
John Hershberger
,
Monika Rauch
,
Subhash Suri
Lecture Notes in Computer Science
621
, 1992, pp. 233-244
How to draw a series-parallel digraph
P. Bertolazzi
,
R.F. Cohen
,
G. Di Battista
,
R. Tamassia
,
I.G. Tollis
Lecture Notes in Computer Science
621
, 1992, pp. 272-283
Coloring random graphs
Martin Fürer
,
C.R. Subramanian
Lecture Notes in Computer Science
621
, 1992, pp. 284-291
Parametric problems on graphs of bounded tree-width
David Fernández-Baca
,
Giora Slutzki
Lecture Notes in Computer Science
621
, 1992, pp. 304-316
Improvements on geometric pattern matching problems
L. Paul Chew
,
Klara Kedem
Lecture Notes in Computer Science
621
, 1992, pp. 318-325
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>