13306 search results - page 429 / 2662 » Theoretical Computer Science |
141
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We study the learning models defined in [AKST97]: Learning with equivalence and limited membership queries and learning with equivalence and malicious membership queries. We show ...
185
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator...
168
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...
164
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
156
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...