Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=965

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

Discrete time process algebra with abstraction
J.C.M. Baeten, J.A. Bergstra
Lecture Notes in Computer Science 965, 1995, pp. 1-15
A duration calculus with infinite intervals
Zhou Chaochen, Dang Van Hung, Li Xiaoshan
Lecture Notes in Computer Science 965, 1995, pp. 16-41
A delegation-based object calculus with subtyping
Kathleen Fisher, John C. Mitchell
Lecture Notes in Computer Science 965, 1995, pp. 42-61
Model-checking for real-time systems
Kim G. Larsen, Paul Pettersson, Wang Yi
Lecture Notes in Computer Science 965, 1995, pp. 62-88
On polynomial ideals, their complexity, and applications
Ernst W. Mayr
Lecture Notes in Computer Science 965, 1995, pp. 89-105
From a concurrent \lambda-calculus to the \pi-calculus
Roberto M. Amadio, Lone Leth, Bent Thomsen
Lecture Notes in Computer Science 965, 1995, pp. 106-115
Rewriting regular inequalities
Valentin Antimirov
Lecture Notes in Computer Science 965, 1995, pp. 116-125
A simple abstract semantics for equational theories
Gilles Barthe
Lecture Notes in Computer Science 965, 1995, pp. 126-135
Processes with multiple entries and exits
J.A. Bergstra, Gh.Ştefănescu
Lecture Notes in Computer Science 965, 1995, pp. 136-145
Efficient rewriting in cograph trace monoids
Michael Bertol
Lecture Notes in Computer Science 965, 1995, pp. 146-155
Effective category and measure in abstract complexity theory
Cristian Calude, Marius Zimand
Lecture Notes in Computer Science 965, 1995, pp. 156-170
About planar Cayley graphs
Thomas Chaboud
Lecture Notes in Computer Science 965, 1995, pp. 171-180
On Condorcet and median points of simple rectilinear polygons
Victor D. Chepoi, Feodor F. Dragan
Lecture Notes in Computer Science 965, 1995, pp. 181-190
Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
Lecture Notes in Computer Science 965, 1995, pp. 191-200
r-domination problems on homogeneously orderable graphs
Feodor F. Dragan, Falk Nicolai
Lecture Notes in Computer Science 965, 1995, pp. 201-210
Growing patterns in 1D cellular automata
Bruno Durand, Jacques Mazoyer
Lecture Notes in Computer Science 965, 1995, pp. 211-220
Petri nets, commutative context-free grammars, and basic parallel processes
Javier Esparza
Lecture Notes in Computer Science 965, 1995, pp. 221-232
Implementation of a UU-algorithm for primitve recursive tree functions
Heinz Fa\ssbender
Lecture Notes in Computer Science 965, 1995, pp. 233-242
Dummy elimination: Making termination easier
M.C.F. Ferreira, H. Zantema
Lecture Notes in Computer Science 965, 1995, pp. 243-252
Computing Petri net languages by reductions
Anja Gronewold, Hans Fleichhack
Lecture Notes in Computer Science 965, 1995, pp. 253-262
Categorial graphs
Erik de Haas
Lecture Notes in Computer Science 965, 1995, pp. 263-272
Effective systolic algorithms for gossiping in cycles and two-dimensional grids
Juraj Hromkovic̑, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulik, Hubert Wagener
Lecture Notes in Computer Science 965, 1995, pp. 273-282
Restarting automata
Petr Janc̑ar, Frantis̑ek Mráz, Martin Plátek, Jörg Vogel
Lecture Notes in Computer Science 965, 1995, pp. 283-292
Optimal contiguous expression DAG evaluations
Christoph W. Ke\ssler, Thomas Rauber
Lecture Notes in Computer Science 965, 1995, pp. 293-302
Communication as unification in the Petri box calculus
Hanna Klaudel, Elisabeth Pelz
Lecture Notes in Computer Science 965, 1995, pp. 303-312

Seiten 1 2 >