Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=944

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

Theory of 2-structures
A. Ehrenfeucht, T. Harju, G. Rozenberg
Lecture Notes in Computer Science 944, 1995, pp. 1-14
A domain for concurrent termination: A generalization of Mazurkiewicz traces
Volker Diekert, Paul Gastin
Lecture Notes in Computer Science 944, 1995, pp. 15-26
Nonfinite axiomatizability of the equational theory of shuffle
Zoltán Ésik, Michael Bertol
Lecture Notes in Computer Science 944, 1995, pp. 27-38
The algebraic equivalent of AFL theory
Werner Kuich
Lecture Notes in Computer Science 944, 1995, pp. 39-50
Finite state transformations of images
Karel Culik, Jarkko Kari
Lecture Notes in Computer Science 944, 1995, pp. 51-62
Post correspondence problem: Words possible as primitive solutions
Marjo Lipponen
Lecture Notes in Computer Science 944, 1995, pp. 63-74
Computing the closure of sets of words under partial commutations
Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier
Lecture Notes in Computer Science 944, 1995, pp. 75-86
Intervalizing k-colored graphs
Hans L. Bodlaender, Babette de Fluiter
Lecture Notes in Computer Science 944, 1995, pp. 87-98
NC algorithms for finding a maximal set of paths with application to compressing strings
Zhi-Zhong Chen
Lecture Notes in Computer Science 944, 1995, pp. 99-110
On the construction of classes of suffix trees for square matrices: Algorithms and applications
Raffaele Giancarlo, Roberto Grossi
Lecture Notes in Computer Science 944, 1995, pp. 111-122
How to use the minimal separators of a graph for its chordal triangulation
Andreas Parra, Petra Scheffler
Lecture Notes in Computer Science 944, 1995, pp. 123-134
Fast gossiping by short messages
J.-C. Bermond, L. Gargano, A.A. Rescigno, U. Vaccaro
Lecture Notes in Computer Science 944, 1995, pp. 135-146
Break finite automata public key cryptosystem
Feng Bao, Yoshihide Igarashi
Lecture Notes in Computer Science 944, 1995, pp. 147-158
Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
S. Nikoletseas, J. Reif, P. Spirakis, M. Yung
Lecture Notes in Computer Science 944, 1995, pp. 159-170
On the number of random bits in totally private computation
Carlo Blundo, Alfredo De Santis, Giuseppe Persiano, Ugo Vaccaro
Lecture Notes in Computer Science 944, 1995, pp. 171-182
Lower time bounds for randomized computation
Rūsiņs̆ Freivalds, Marek Karpinski
Lecture Notes in Computer Science 944, 1995, pp. 183-195
New collapse consequences of NP having small circuits
Johannes Köbler, Osamu Watanabe
Lecture Notes in Computer Science 944, 1995, pp. 196-207
The complexity of searching succinctly represented graphs
José L. Balcázar
Lecture Notes in Computer Science 944, 1995, pp. 208-219
Optimal shooting: Characterizations and applications
Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia
Lecture Notes in Computer Science 944, 1995, pp. 220-231
Placing resources in a tree: Dynamic and static algorithms
Vincenzo Auletta, Domenico Parente, Giuseppe Persiano
Lecture Notes in Computer Science 944, 1995, pp. 232-243
Shortes path queries in digraphs of small treewidth
Shiva Chaudhuri, Christos D. Zaroliagis
Lecture Notes in Computer Science 944, 1995, pp. 244-255
A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
M.J. Golin, Günter Rote
Lecture Notes in Computer Science 944, 1995, pp. 256-267
Parallel algorithms with optimal speedup for bounded treewidth
Hans L. Bodlaender, Torben Hagerup
Lecture Notes in Computer Science 944, 1995, pp. 268-279
Approximating minimum cuts under insertions
Monika Rauch Henzinger
Lecture Notes in Computer Science 944, 1995, pp. 280-291
Linear time algorithms for dominating pairs in asteroidal triple-free graphs
Derek G. Corneil, Stephan Olariu, Lorna Stewart
Lecture Notes in Computer Science 944, 1995, pp. 292-302

Seiten 1 2 3 >