535 search results - page 3 / 107 » Checking Computations in Polylogarithmic Time |
RECOMB
2001
Springer
14 years 7 months ago
2001
Springer
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
CONCUR
2004
Springer
14 years 9 days ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
LICS
2009
IEEE
14 years 1 months ago
2009
IEEE
STOC
2010
ACM
13 years 11 months ago
2010
ACM
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMS...
STOC
1999
ACM
13 years 11 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...