Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1295

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

Game semantics for programming languages
Samson Abramsky
Lecture Notes in Computer Science 1295, 1997, pp. 3-4
Communication complexity
László Babai
Lecture Notes in Computer Science 1295, 1997, pp. 5-18
Treewidth: Algorithmic techniques and results
Hans L. Bodlaender
Lecture Notes in Computer Science 1295, 1997, pp. 19-36
When are two rewrite systems more than none?
Nachum Dershowitz
Lecture Notes in Computer Science 1295, 1997, pp. 37-43
Positive applications of lattices to cryptography
Cynthia Dwork
Lecture Notes in Computer Science 1295, 1997, pp. 44-51
A tile-based coordination view of asynchronous \pi-calculus
Gian Luigi Ferrari, Ugo Montanari
Lecture Notes in Computer Science 1295, 1997, pp. 52-70
Communication complexity and sequential computation
Juraj Hromkovic̑, Georg Schnitger
Lecture Notes in Computer Science 1295, 1997, pp. 71-84
Lower bounds for a proof system with an exponential speed-up over constant-depth Frege systems and over polynomial calculus
Jan Krajíc̑ek
Lecture Notes in Computer Science 1295, 1997, pp. 85-90
Computational limitations of stochastic Turing machines and Arthur-Merlin games with small space bounds
Maciej Liśkiewicz, Rüdiger Reischuk
Lecture Notes in Computer Science 1295, 1997, pp. 91-107
Learning to perform knowledge-intensive inferences
Dan Roth
Lecture Notes in Computer Science 1295, 1997, pp. 108-109
Resolution proofs, exponential bounds, and Kolmogorov complexity
Uwe Schöning
Lecture Notes in Computer Science 1295, 1997, pp. 110-116
The expressiveness of Datalog circuits (DAC)
Foto Afrati, Irène Guessarian, Michel de Rougemont
Lecture Notes in Computer Science 1295, 1997, pp. 119-128
The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes
Martin Mundhenk, Judy Goldsmith, Eric Allender
Lecture Notes in Computer Science 1295, 1997, pp. 129-138
A category of transition systems and its relations with orthomodular posets
Luca Bernardinello, Lucia Pomello
Lecture Notes in Computer Science 1295, 1997, pp. 139-148
Accepting Zeno words without making time stand still
Béatrice Bérard, Claudine Picaronny
Lecture Notes in Computer Science 1295, 1997, pp. 149-158
Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
Beate Bollig, Ingo Wegener
Lecture Notes in Computer Science 1295, 1997, pp. 159-168
Specifying computations using hyper transition systems
Marcello M. Bonsangue, Joost N. Kok
Lecture Notes in Computer Science 1295, 1997, pp. 169-178
A shift-invariant metric on S^{zz} inducing a non-trivial topology
G. Cattaneo, E. Formenti, L. Margara, J. Mazoyer
Lecture Notes in Computer Science 1295, 1997, pp. 179-188
Subtyping calculus of construction
Gang Chen
Lecture Notes in Computer Science 1295, 1997, pp. 189-198
Distances between languages and reflexivity of relations
Christian Choffrut, Giovanni Pighizzini
Lecture Notes in Computer Science 1295, 1997, pp. 199-208
Partial characterization of synchronization languages
Isabelle Ryl, Yves Roos, Mireille Clerbout
Lecture Notes in Computer Science 1295, 1997, pp. 209-218
Integrating the specification techniques of graph transformation and temporal logic
Reiko Heckel, Hartmut Ehrig, Uwe Wolter, Andrea Corradini
Lecture Notes in Computer Science 1295, 1997, pp. 219-228
On the generation of trees by hyperedge replacement
Frank Drewes
Lecture Notes in Computer Science 1295, 1997, pp. 229-238
Regulation by valences
Henning Fernau, Ralf Stiebe
Lecture Notes in Computer Science 1295, 1997, pp. 239-248
Simulation as a correct transformation of rewrite systems
Wan Fokkink, Jaco van de Pol
Lecture Notes in Computer Science 1295, 1997, pp. 249-258

Seiten 1 2 3 >