ICALP
2007
Springer
14 years 5 months ago
2007
Springer
In this paper we consider the classical Erd˝os-R´enyi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ , for any fixed δ > 0, the chromatic number χ...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarante...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We study the boundedness problem for monadic least fixed points as a decision problem. While this problem is known to be undecidable in general and even for syntactically very res...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider th...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs significantly the state-of-the-art algorithm for this task [20]. Speci...