Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=529

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

Recent progress in circuit and communication complexity
Andrew Chi-Chih Yao
Lecture Notes in Computer Science 529, 1991, pp. 104
On strong separations from AC^0
Eric Allender, Vivek Gore
Lecture Notes in Computer Science 529, 1991, pp. 1-15
Number theoretic algorithms and cryptology
Johannes Buchmann
Lecture Notes in Computer Science 529, 1991, pp. 16-21
Computations over infinite groups
Jin-yi Cai
Lecture Notes in Computer Science 529, 1991, pp. 22-32
Efficiency of Monte Carlo algorithms in numerical analysis
Stefan Heinrich
Lecture Notes in Computer Science 529, 1991, pp. 33-44
Approximation algorithms for counting problems in finite fields
Marek Karpinski
Lecture Notes in Computer Science 529, 1991, pp. 45-46
Lower bounds for deterministic and nondeterministic branching programs
Alexander A. Razborov
Lecture Notes in Computer Science 529, 1991, pp. 47-60
Graph theoretical methods for the design of parallel algorithms
Rüdiger Reischuk
Lecture Notes in Computer Science 529, 1991, pp. 61-67
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
C.P. Schnorr, M. Euchner
Lecture Notes in Computer Science 529, 1991, pp. 68-85
Information-based complexity: Recent results and open problems
Joseph F. Traub
Lecture Notes in Computer Science 529, 1991, pp. 86-88
A survey of some aspects of computational learning theory
György Turán
Lecture Notes in Computer Science 529, 1991, pp. 89-103
The consistency of a nointerleaving and an interleaving model for full TCSP
Christel Baier, Mila E. Majster-Cederbaum
Lecture Notes in Computer Science 529, 1991, pp. 105-120
A geometrical bound for integer programming with polynomial constraints
Bernd Bank, Teresa Krick, Reinhard Mandel, Pablo Solernó
Lecture Notes in Computer Science 529, 1991, pp. 121-125
A characterization of binary search networks
E. Barcucci, R. Pinzani, E. Rodella, R. Sprugnoli
Lecture Notes in Computer Science 529, 1991, pp. 126-135
About the effect of the number of successful paths in an infinite tree on the recognizability by a finite automaton with Büchi conditions
D. Beauqier, M. Nivat, D. Niwiński
Lecture Notes in Computer Science 529, 1991, pp. 136-145
Deterministic dequeue automata and LL(1) parsing of breadth-depth grammars
Luca Breveglieri, Claudio Citrini, Stefano Crespi Reghizzi
Lecture Notes in Computer Science 529, 1991, pp. 146-156
The complexity of computing maximal word functions
Danilo Bruschi, Giovanni Pighizzini
Lecture Notes in Computer Science 529, 1991, pp. 157-167
Unambiguity and fewness for logarithmic space
Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith
Lecture Notes in Computer Science 529, 1991, pp. 168-179
Differential resultants and subresultants
Marc Chardin
Lecture Notes in Computer Science 529, 1991, pp. 180-189
Unifying binary-search trees and permutations
Bogdan S. Chlebus, Imrich Vrt̆o
Lecture Notes in Computer Science 529, 1991, pp. 190-199
Computational complexity and hardest languages of automata with abstract storages
Jürgen Dassow, Klaus-Jörn Lange
Lecture Notes in Computer Science 529, 1991, pp. 200-209
Systolic Y-tree automata: Closure properties and decision problems
E. Fachini, A. Monti, M. Napoli, D. Parente
Lecture Notes in Computer Science 529, 1991, pp. 210-219
A new partition lemma for planar graphs and its application to circuit complexity
Hans Dietmar Gröger
Lecture Notes in Computer Science 529, 1991, pp. 220-229
Some notes on threshold circuits, and multiplication in depth 4
Thomas Hofmeister, Walter Hohberg, Susanne Köhling
Lecture Notes in Computer Science 529, 1991, pp. 230-239
Nonlinear lower bounds on the number of processors of circuits with sublinear separators
Juraj Hromkovic̑
Lecture Notes in Computer Science 529, 1991, pp. 240-247

Seiten 1 2 >