Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND YEAR=1991

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

Stochastic automata and length distributions of rational languages
Georges Hansel, Daniel Krob, Christian Michaux
Lecture Notes in Computer Science 520, 1991, pp. 181-190
Towards a categorical semantics of type classes
Barney P. Hilken, David E. Rydeheard
Lecture Notes in Computer Science 520, 1991, pp. 191-201
Single-path Petri nets
Rodney R. Howell, Petr Janc̑ar, Louis E. Rosier
Lecture Notes in Computer Science 520, 1991, pp. 202-210
The bisection problem for graphs of degree 4 (configuring transputer systems)
Juraj Hromkovic̑, Burkhard Monien
Lecture Notes in Computer Science 520, 1991, pp. 211-220
Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata
Oscar H. Ibarra, Tao Jiang, Hui Wang
Lecture Notes in Computer Science 520, 1991, pp. 221-230
Infinite normal forms for non-linear term rewriting systems
P. Inverardi, M. Nesi
Lecture Notes in Computer Science 520, 1991, pp. 231-239
Two algorithms for approximate string matching in static texts
Petteri Jokinen, Esko Ukkonen
Lecture Notes in Computer Science 520, 1991, pp. 240-248
Efficient constructions of test sets for regular and context-free languages
Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek
Lecture Notes in Computer Science 520, 1991, pp. 249-258
The complexity of the reliable connectivity problem
Dimitris Kavadias, Lefteris M. Kirousis, Paul Spirakis
Lecture Notes in Computer Science 520, 1991, pp. 259-266
Pattern matching in order-sorted languages
Delia Kesner
Lecture Notes in Computer Science 520, 1991, pp. 267-276
Two over three: A two-valued logic for software specification and validation over a three-valued predicate calculus
Beata Konikowska
Lecture Notes in Computer Science 520, 1991, pp. 277-286
A case study in comparison based complexity: Finding the nearest value(s)
Walter Cunto, J. Ian Munro, Patricio V. Poblete
Lecture Notes in Computer Science 519, 1991, pp. 1-12
On the zone of a surface in a hyperplane arrangement
Boris Aronov, Micha Sharir
Lecture Notes in Computer Science 519, 1991, pp. 13-19
Finding level-ancestors in dynamic trees
Paul F. Dietz
Lecture Notes in Computer Science 519, 1991, pp. 32-40
Fully dynamic Delaunay triangulation in logarithmic expected time per operation
Olivier Devillers, Stefan Meiser, Monique Teillaud
Lecture Notes in Computer Science 519, 1991, pp. 42-53
On computing the Voronoi diagram for restricted planar figures
Hristo Djidjev, Andrzej Lingas
Lecture Notes in Computer Science 519, 1991, pp. 54-64
The MINSUMCUT problem
J. Díaz, A.M. Gibbons, M.S. Paterson, J. Torán
Lecture Notes in Computer Science 519, 1991, pp. 65-79
Efficient algorithms for the minimum range cut problems
Naoki Katoh, Kazuo Iwano
Lecture Notes in Computer Science 519, 1991, pp. 80-91
Memory access in models of parallel computation: From folklore to synergy and beyond
Selim G. Akl
Lecture Notes in Computer Science 519, 1991, pp. 92-104
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
Pankaj K. Agarwal, Jiȓí Matous̑ek, Subhash Suri
Lecture Notes in Computer Science 519, 1991, pp. 105-116
Sharing memory in asynchronous message passing systems
Oscar R. Aguilar, Ajoy Kumar Datta, Sukumar Ghosh
Lecture Notes in Computer Science 519, 1991, pp. 129-140
The interval skip list: A data structure for finding all intervals that overlap a point
Eric N. Hanson
Lecture Notes in Computer Science 519, 1991, pp. 153-164
Geometric knapsack problems
Esther M. Arkin, Samir Khuller, Joseph S.B. Mitchell
Lecture Notes in Computer Science 519, 1991, pp. 165-176
A fast derandomization scheme and its applications
Yijie Han
Lecture Notes in Computer Science 519, 1991, pp. 177-188
Immobilizing a polytope
Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia
Lecture Notes in Computer Science 519, 1991, pp. 214-227

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