Sciweavers

13 search results - page 1 / 3
» jacm 2000
Sort
View
81
Voted
JACM
2000
55views more  JACM 2000»
15 years 26 days ago
An automata-theoretic approach to branching-time model checking
Orna Kupferman, Moshe Y. Vardi, Pierre Wolper
87
Voted
JACM
2000
56views more  JACM 2000»
15 years 26 days ago
Complexity of finite-horizon Markov decision process problems
Martin Mundhenk, Judy Goldsmith, Christopher Lusen...
84
Voted
JACM
2000
50views more  JACM 2000»
15 years 26 days ago
Tight bounds for k-set agreement
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
84
Voted
JACM
2000
57views more  JACM 2000»
15 years 26 days ago
Contention resolution with constant expected delay
Leslie Ann Goldberg, Philip D. MacKenzie, Mike Pat...
92
Voted
JACM
2000
119views more  JACM 2000»
15 years 26 days 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