Sciweavers

13 search results - page 1 / 3
» jacm 2000
Sort
View
JACM
2000
55views more  JACM 2000»
13 years 4 months ago
An automata-theoretic approach to branching-time model checking
Orna Kupferman, Moshe Y. Vardi, Pierre Wolper
JACM
2000
56views more  JACM 2000»
13 years 4 months ago
Complexity of finite-horizon Markov decision process problems
Martin Mundhenk, Judy Goldsmith, Christopher Lusen...
JACM
2000
50views more  JACM 2000»
13 years 4 months ago
Tight bounds for k-set agreement
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
JACM
2000
57views more  JACM 2000»
13 years 4 months ago
Contention resolution with constant expected delay
Leslie Ann Goldberg, Philip D. MacKenzie, Mike Pat...
JACM
2000
119views more  JACM 2000»
13 years 4 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle