Sciweavers

327 search results - page 9 / 66
» Algorithms for infinite huffman-codes
Sort
View
POPL
2008
ACM
14 years 10 months ago
Subcubic algorithms for recursive state machines
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...
Swarat Chaudhuri
CAV
2007
Springer
122views Hardware» more  CAV 2007»
14 years 1 months ago
Parameterized Verification of Infinite-State Processes with Global Conditions
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
TALG
2008
97views more  TALG 2008»
13 years 9 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 9 months ago
Dimension Extractors and Optimal Decompression
A dimension extractor is an algorithm designed to increase the effective dimension
David Doty
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 10 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah