Sciweavers

ICALP
1997
Springer
13 years 8 months ago
Improving Spanning Trees by Upgrading Nodes
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Nol...
ICALP
1997
Springer
13 years 8 months ago
Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
Olaf Burkart, Bernhard Steffen
ICALP
1997
Springer
13 years 9 months ago
NP-Completeness: A Retrospective
For a quarter of a century now, NP-completeness has been computer science's favorite paradigm, fad, punching bag, buzzword, alibi, and intellectual export. This paper is a fra...
Christos H. Papadimitriou
ICALP
1997
Springer
13 years 9 months ago
The Theory of Vaccines
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
Massimo Marchiori
ICALP
1997
Springer
13 years 9 months ago
Recursive Computational Depth
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
James I. Lathrop, Jack H. Lutz
ICALP
1997
Springer
13 years 9 months ago
Discrete-Time Control for Rectangular Hybrid Automata
Rectangular hybrid automatamodel digital control programs of analog plant environments. We study rectangular hybrid automatawhere the plant state evolves continuously in real-numbe...
Thomas A. Henzinger, Peter W. Kopke
ICALP
1997
Springer
13 years 9 months ago
Maintaining Minimum Spanning Trees in Dynamic Graphs
Monika Rauch Henzinger, Valerie King