Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=880

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

Efficient resolution of singularities of plane curves
Dexter Kozen
Lecture Notes in Computer Science 880, 1994, pp. 1-11
On the interactive complexity of graph reliability
Jean-Marc Couveignes, Juan Francisco Diaz-Frias, Michel de Rougemont, Miklos Santha
Lecture Notes in Computer Science 880, 1994, pp. 12-23
Matching upper and lower bounds for simulations of several tapes on one multidimensional tape
Martin Dietzfelbinger, Martin Hühne
Lecture Notes in Computer Science 880, 1994, pp. 24-35
The complexity of computing over quasigroups
Hervé Caussinnus, François Lemieux
Lecture Notes in Computer Science 880, 1994, pp. 36-47
Non-commutative computation, depth reduction, and skew circuits
Meena Mahajan, V Vinay
Lecture Notes in Computer Science 880, 1994, pp. 48-59
Inductive definitions and type theory - an introduction (preliminary version)
Thierry Coquand, Peter Dybjer
Lecture Notes in Computer Science 880, 1994, pp. 60-76
Interpreter verification for a functional language
Manfred Broy, Ursula Hinkel, Tobias Nipkow, Christian Prehofer, Birgit Schieder
Lecture Notes in Computer Science 880, 1994, pp. 77-88
An epistemic foundation for logic programming with uncertainty
Laks V.S. Lakshmanan
Lecture Notes in Computer Science 880, 1994, pp. 89-100
On typed calculi with a merge operator
Hideki Tsuiki
Lecture Notes in Computer Science 880, 1994, pp. 101-112
Incremental algorithms for the single-source shortest path problem
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Lecture Notes in Computer Science 880, 1994, pp. 113-124
An O(n) algorithm for realizing degree sequences
Srinivasa Rao Arikati, Anil Maheshwari
Lecture Notes in Computer Science 880, 1994, pp. 125-136
Coloring semi-random graphs in polynomial expected time
C.R. Subramanian, C.E. Veni Madhavan
Lecture Notes in Computer Science 880, 1994, pp. 137-148
Finite-state strategies in regular infinite games
Wolfgang Thomas
Lecture Notes in Computer Science 880, 1994, pp. 149-158
Location of the largest empty rectangle among arbitrary obstacles
Subhas C. Nandy, Arani Sinha, Bhargab B. Bhattacharya
Lecture Notes in Computer Science 880, 1994, pp. 159-170
Efficient parallel and linear time sequential split decomposition
Elias Dahlhaus
Lecture Notes in Computer Science 880, 1994, pp. 171-180
Algorithms for convex visibility problems
Supriya Biswas, D. Chithra Prasad, Sudepkumar Prasant Pal
Lecture Notes in Computer Science 880, 1994, pp. 181-192
Lower bounds for parallel algebraic decision trees, complexity of convex hulls and related problems
Sandeep Sen
Lecture Notes in Computer Science 880, 1994, pp. 193-204
Localities and failures
Roberto M. Amadio, Sanjiva Prasad
Lecture Notes in Computer Science 880, 1994, pp. 205-216
Priority and abstraction in process algebra
V. Natarajan, I. Christoff, L. Christoff, R. Cleaveland
Lecture Notes in Computer Science 880, 1994, pp. 217-230
On the computational power of operators in ICSP with fairness
K Narayan Kumar, Paritosh K Pandya
Lecture Notes in Computer Science 880, 1994, pp. 231-242
Decidability of timed language-inclusion for networks of real-time communicating sequential processes
Wang Yi, Bengt Jonsson
Lecture Notes in Computer Science 880, 1994, pp. 243-255
My favorite ten complexity theorems of the past decade
Lance Fortnow
Lecture Notes in Computer Science 880, 1994, pp. 256-275
Solving a unification problem under constrained substitutions using tree automata
Yuichi Kaji, Toru Fujiwara, Tadao Kasami
Lecture Notes in Computer Science 880, 1994, pp. 276-287
Automata-driven efficient subterm unification
R. Ramesh, I.V. Ramakrishnan, R.C. Sekar
Lecture Notes in Computer Science 880, 1994, pp. 288-299
Randomized approximation algorithms in combinatorial optimization
Prabhakar Raghavan
Lecture Notes in Computer Science 880, 1994, pp. 300-317

Seiten 1 2 >