Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND YEAR=1989

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

Time bounds for broadcasting in bounded degree graphs
Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
Lecture Notes in Computer Science 411, 1989, pp. 19-33
t/s-diagnosable systems: A characterization and diagnosis algorithm
A. Das, K. Thulasiraman, V.K. Agarwal, K.B. Lakshmanan
Lecture Notes in Computer Science 411, 1989, pp. 34-45
Toward a complete representation of graphoids in graphs
Robert Y. Geva, Azaria Paz
Lecture Notes in Computer Science 411, 1989, pp. 46-62
Graph rewriting systems with priorities
Michel Billaud, Pierre Lafon, Yves Metivier, Eric Sopena
Lecture Notes in Computer Science 411, 1989, pp. 94-106
Filtering hyperedge-replacement languages through compatible properties
Annegret Habel, Hans-Jörg Kreowski
Lecture Notes in Computer Science 411, 1989, pp. 107-120
A parser for context free plex grammars
H. Bunke, B. Haller
Lecture Notes in Computer Science 411, 1989, pp. 136-150
On the complexity of optimal drawings of graphs
Franz J. Brandenburg
Lecture Notes in Computer Science 411, 1989, pp. 166-180
Improved self-reduction algorithms for graphs with bounded treewidth
Hans L. Bodlaender
Lecture Notes in Computer Science 411, 1989, pp. 232-244
Paging binary trees with external balancing
Andreas Henrich, Hans-Werner Six, Peter Widmayer
Lecture Notes in Computer Science 411, 1989, pp. 260-276
An O(n\log n) algorithm for 1-D tile compaction
Richard Anderson, Simon Kahan, Martine Schlag
Lecture Notes in Computer Science 411, 1989, pp. 287-301
Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry
Frank Dehne, Andrew Rau-Chaplin
Lecture Notes in Computer Science 411, 1989, pp. 316-329
Combinatorial properties of abstract Voronoi diagrams
Rolf Klein
Lecture Notes in Computer Science 411, 1989, pp. 356-369
A linear-time recognition algorithm for P_4-reducible graphs
B. Jamison, S. Olariu
Lecture Notes in Computer Science 405, 1989, pp. 1-19
An autoepistemic logical view of knowledge base
Y.J. Jiang
Lecture Notes in Computer Science 405, 1989, pp. 68-77
A natural semantics for logic programs with negation
Phan Minh Dung, Kanchana Kanchanasut
Lecture Notes in Computer Science 405, 1989, pp. 78-88
An efficient distributed algorithm for finding articulation points, bridges, and biconnected components in asynchronous networks
Mohan Ahuja, Yahui Zhu
Lecture Notes in Computer Science 405, 1989, pp. 99-108
An adaptive regulator approach for the design of load sharing algorithms
F. Bonomi, P.J. Fleming, P. Steinberg
Lecture Notes in Computer Science 405, 1989, pp. 121-130
An algebraic compositional semantics of an object oriented notation with concurrency
Ruth Breu, Elena Zucca
Lecture Notes in Computer Science 405, 1989, pp. 131-142
Deducing causal relationships in CCS
Jeremy Gunawardena
Lecture Notes in Computer Science 405, 1989, pp. 161-170
Annotated program transformations
Viktor N. Kasyanov
Lecture Notes in Computer Science 405, 1989, pp. 171-180
Algebraic software development concepts for module and configuration families
Hartmut Ehrig, Werner Fey, Horst Hansen, Michael Löwe, Dean Jacobs
Lecture Notes in Computer Science 405, 1989, pp. 181-192
On the limitations of locally robust positive reductions
Lane A. Hemachandra, Sanjay Jain
Lecture Notes in Computer Science 405, 1989, pp. 193-203
Average case complexity analysis of RETE pattern-match algorithm and average size of join in databases
Luc Albert
Lecture Notes in Computer Science 405, 1989, pp. 223-241
The Frobenius problem
Ravi Kannan
Lecture Notes in Computer Science 405, 1989, pp. 242-251
An efficient implicit data structure for path testing and searching in rooted trees and forests
Giorgio Gambosi, Marco Protasi, Maurizio Talamo
Lecture Notes in Computer Science 405, 1989, pp. 252-266

Seiten 1 2 3 4 5 6 7 8 9 10 11 12 >