Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1974

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

Model checking: Theory into practice
E. Allen Emerson
Lecture Notes in Computer Science 1974, 2000, pp. 1-10
An algebra for XML query
Mary Fernandez, Jerome Simeon, Philip Wadler
Lecture Notes in Computer Science 1974, 2000, pp. 11-45
Irregularities of distribution, derandomization, and complexity theory
Bernard Chazelle
Lecture Notes in Computer Science 1974, 2000, pp. 46-54
Rewriting logic as a metalogical framework
David Basin, Manuel Clavel, José Meseguer
Lecture Notes in Computer Science 1974, 2000, pp. 55-80
Frequency assignment in mobile phone systems
Martin Grötschel
Lecture Notes in Computer Science 1974, 2000, pp. 81-86
Data provenance: Some basic issues
Peter Buneman, Sanjeev Khanna, Wang-Chiew Tan
Lecture Notes in Computer Science 1974, 2000, pp. 87-93
Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition
Sachin B. Patkar, H. Narayanan
Lecture Notes in Computer Science 1974, 2000, pp. 94-105
On-line edge-coloring with a fixed number of colors
Lene Monrad Favrholdt, Morten Nyhave Nielsen
Lecture Notes in Computer Science 1974, 2000, pp. 106-116
On approximability of the independent/connected edge dominating set problems
Toshihiro Fujito
Lecture Notes in Computer Science 1974, 2000, pp. 117-126
Model checking CTL properties of pushdown systems
Igor Walukiewicz
Lecture Notes in Computer Science 1974, 2000, pp. 127-138
A decidable dense branching-time temporal logic
Salvatore La Torre, Margherita Napoli
Lecture Notes in Computer Science 1974, 2000, pp. 139-150
Fair equivalence relations
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
Lecture Notes in Computer Science 1974, 2000, pp. 151-163
Arithmetic circuits and polynomial replacement systems
Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
Lecture Notes in Computer Science 1974, 2000, pp. 164-175
Depth-3 arithmetic circuits for S_n^2(X) and extensions of the Graham-Pollack theorem
Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
Lecture Notes in Computer Science 1974, 2000, pp. 176-187
The bounded weak monadic quantifier alternation hierarchy of equational graphs is infinite
Olivier Ly
Lecture Notes in Computer Science 1974, 2000, pp. 188-200
Combining semantics with non-standard interpreter hierarchies
Sergei Abramov, Robert Glück
Lecture Notes in Computer Science 1974, 2000, pp. 201-213
Using modes to ensure subject reduction for typed logic programs with subtyping
Jan-Georg Smaus, François Fages, Pierre Deransart
Lecture Notes in Computer Science 1974, 2000, pp. 214-226
Dynamically ordered probabilistic choice logic programming
Marina De Vos, Dirk Vermeir
Lecture Notes in Computer Science 1974, 2000, pp. 227-239
Coordinatized kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems
Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege
Lecture Notes in Computer Science 1974, 2000, pp. 240-251
Planar graph blocking for external searching
Surender Baswana, Sandeep Sen
Lecture Notes in Computer Science 1974, 2000, pp. 252-263
A complete fragment of higher-order duration \mu-calculus
Dimitar P. Guelev
Lecture Notes in Computer Science 1974, 2000, pp. 264-276
A complete axiomatisation for timed automata
Huimin Lin, Wang Yi
Lecture Notes in Computer Science 1974, 2000, pp. 277-289
Text sparsification via local maxima
Pilu Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
Lecture Notes in Computer Science 1974, 2000, pp. 290-301
Approximate swapped matching
Amihood Amir, Moshe Lewenstein, Ely Porat
Lecture Notes in Computer Science 1974, 2000, pp. 302-311
A semantic theory for heterogeneous system design
Rance Cleaveland, Gerald Lüttgen
Lecture Notes in Computer Science 1974, 2000, pp. 312-324

Seiten 1 2 >