Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=911

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

Visibility graphs of 2-spiral polygons
James Abello, Krishna Kumar
Lecture Notes in Computer Science 911, 1995, pp. 1-15
Random generation of colored trees
L. Alonso, R. Schott
Lecture Notes in Computer Science 911, 1995, pp. 16-35
Space filling curves and their use in the design of geometric data structures
Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
Lecture Notes in Computer Science 911, 1995, pp. 36-48
Tight bounds for finding degrees from the adjacency matrix
R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan
Lecture Notes in Computer Science 911, 1995, pp. 49-59
Lower bounds for modular counting by circuits with modular gates
David Mix Barrington, Howard Straubing
Lecture Notes in Computer Science 911, 1995, pp. 60-71
On the relation between BDDs and FDDs
Bernd Becker, Rolf Drechsler, Ralph Werchner
Lecture Notes in Computer Science 911, 1995, pp. 72-83
On dynamical properties of generalized toggle automata
F. Blanchard, Alejandro Maass
Lecture Notes in Computer Science 911, 1995, pp. 84-98
Free shuffle algebras in language varieties
Stephen L. Bloom, Zoltán Ésik
Lecture Notes in Computer Science 911, 1995, pp. 99-111
Lower bounds for the matrix chain ordering problem
Phillip G. Bradford, Venkatesh Choppella, Gregory J.E. Rawlins
Lecture Notes in Computer Science 911, 1995, pp. 112-130
Off-line electronic cash based on secret-key certificates
Stefan Brands
Lecture Notes in Computer Science 911, 1995, pp. 131-166
Recognizable sets of numbers in nonstandard bases
Véronique Bruyère, Georges Hansel
Lecture Notes in Computer Science 911, 1995, pp. 167-179
On weak growing context-sensitive grammars
Gerhard Buntrock, Gundula Niemann
Lecture Notes in Computer Science 911, 1995, pp. 180-194
Logic of Plotkin continuous domain
Benjamín R. Callejas Bedregal, Benedito Melo Acióly
Lecture Notes in Computer Science 911, 1995, pp. 195-206
(Probabilistic) recurrence relations revisited
Shiva Chaudhuri, Devdatt Dubhashi
Lecture Notes in Computer Science 911, 1995, pp. 207-219
On linear-time alphabet-independent 2-dimensional pattern matching
Maxime Crochemore, Wojciech Rytter
Lecture Notes in Computer Science 911, 1995, pp. 220-229
Reversible cellular automaton able to simulate any other reversible one using partitioning automata
Jérôme Durand-Lose
Lecture Notes in Computer Science 911, 1995, pp. 230-244
Nearest neighbour graph realizability is NP-hard
Peter Eades, Sue Whitesides
Lecture Notes in Computer Science 911, 1995, pp. 245-256
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
David Fernández-Baca, Giora Slutzki
Lecture Notes in Computer Science 911, 1995, pp. 257-271
Paging more than one page
Esteban Feuerstein
Lecture Notes in Computer Science 911, 1995, pp. 272-285
On edge-colouring indifference graphs
Celina M.H. de Figueiredo, João Meidanis, Célia Picinin de Mello
Lecture Notes in Computer Science 911, 1995, pp. 286-299
On the approximability of some maximum spanning tree problems
Giulia Galbiati, Angelo Morzenti, Francesco Maffioli
Lecture Notes in Computer Science 911, 1995, pp. 300-310
Gauss periods and fast exponentiation in finite fields
Shuhong Gao, Joachim von zur Gathen, Daniel Panario
Lecture Notes in Computer Science 911, 1995, pp. 311-322
Unbounded search and recursive graph problems
William I. Gasarch, Katia S. Guimarães
Lecture Notes in Computer Science 911, 1995, pp. 323-331
On the complexity of computing the greatest common divisor of several univariate polynomials
Laureano González-Vega
Lecture Notes in Computer Science 911, 1995, pp. 332-345
State complexity of SBTA languages
J. Gruska, A. Monti, M. Napoli, D. Parente
Lecture Notes in Computer Science 911, 1995, pp. 346-357

Seiten 1 2 >