Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Vagueness is the phenomenon that natural language predicates have borderline regions of applicability and that the boundaries of the borderline region are not determinable. A theo...
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...