JACM
2007
13 years 5 months ago
2007
JACM
2007
13 years 5 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
JACM
2007
13 years 5 months ago
2007
We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of reg...
JACM
2007
13 years 5 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
JACM
2007
13 years 5 months ago
2007
onal Numbers as an Abstract Data Type1 J A Bergstra2 University of Amsterdam, Informatics Institute, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands J V Tucker3 Department of Com...
JACM
2007
13 years 5 months ago
2007
We propose a calculus of local equations over one-way measurement patterns [1], which preserves interpretations, and allows the rewriting of any pattern to a standard form where e...