Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1530

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

Descriptive complexity and model checking
Neil Immerman
Lecture Notes in Computer Science 1530, 1998, pp. 1-5
Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari
Lecture Notes in Computer Science 1530, 1998, pp. 6-17
A Hamiltonian approach to the assignment of non-reusable frequencies
Dimitris A. Fotakis, Paul G. Spirakis
Lecture Notes in Computer Science 1530, 1998, pp. 18-29
Deadlock sensitive types for lambda calculus with resources
Carolina Lavatelli
Lecture Notes in Computer Science 1530, 1998, pp. 30-41
On encoding p\pi in m\pi
Paola Quaglia, David Walker
Lecture Notes in Computer Science 1530, 1998, pp. 42-53
Improved methods for approximating node weighted Steiner trees and connected dominating sets
Sudipto Guha, Samir Khuller
Lecture Notes in Computer Science 1530, 1998, pp. 54-65
Red-black prefetching: An approximation algorithm for parallel disk scheduling
Mahesh Kallahalla, Peter J. Varman
Lecture Notes in Computer Science 1530, 1998, pp. 66-77
A synchronous semantics of higher-order processes for modeling reconfigurable reactive systems
Jean-Pierre Talpin, David Nowak
Lecture Notes in Computer Science 1530, 1998, pp. 78-89
Testing theories for asynchronous languages
Ilaria Castellani, Matthew Hennessy
Lecture Notes in Computer Science 1530, 1998, pp. 90-101
Alternative computational models: A comparison of biomolecular and quantum computation
John H. Reif
Lecture Notes in Computer Science 1530, 1998, pp. 102-121
Optimal regular tree pattern matching using pushdown automata
Maya Madhavan, Priti Shankar
Lecture Notes in Computer Science 1530, 1998, pp. 122-133
Locating matches of tree patterns in forests
Andreas Neumann, Helmut Seidl
Lecture Notes in Computer Science 1530, 1998, pp. 134-145
Benefits of tree transducers for optimizing functional programs
Armin Kühnemann
Lecture Notes in Computer Science 1530, 1998, pp. 146-157
Implementable failure detectors in asynchronous systems
Vijay K. Garg, J. Roger Mitchell
Lecture Notes in Computer Science 1530, 1998, pp. 158-169
BRICS and quantum information processing
Erik Meineche Schmidt
Lecture Notes in Computer Science 1530, 1998, pp. 170-173
Martingales and locality in distributed computing
Devdatt P. Dubhashi
Lecture Notes in Computer Science 1530, 1998, pp. 174-185
Space efficient suffix trees
Ian Munro, Venkatesh Raman, S. Srinivasa Rao
Lecture Notes in Computer Science 1530, 1998, pp. 186-196
Formal verification of an O.S. submodule
N.S. Pendharkar, K. Gopinath
Lecture Notes in Computer Science 1530, 1998, pp. 197-208
Infinite probabilistic and nonprobabilistic testing
K. Narayan Kumar, Rance Cleaveland, Scott A. Smolka
Lecture Notes in Computer Science 1530, 1998, pp. 209-220
On generating strong elimination orderings of strongly chordal graphs
N. Kalyana Rama Prasad, P. Sreenivasa Kumar
Lecture Notes in Computer Science 1530, 1998, pp. 221-232
A parallel approximation algorithm for minimum weight triangulation
Joachim Gudmundsson, Christos Levcopoulos
Lecture Notes in Computer Science 1530, 1998, pp. 233-244
The power of reachability testing for timed automata
Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim G. Larsen
Lecture Notes in Computer Science 1530, 1998, pp. 245-256
Recursive mean-value calculus
Paritosh K. Pandya, Y.S. Ramakrishna
Lecture Notes in Computer Science 1530, 1998, pp. 257-268
Efficient formal verification of hierarchical descriptions
Rajeev Alur
Lecture Notes in Computer Science 1530, 1998, pp. 269-269
Proof rules for model checking systems with data
K.L. McMillan
Lecture Notes in Computer Science 1530, 1998, pp. 270-270

Seiten 1 2 >