Add to ORKGWe introduce the first graph-theoretic proof-of-work system, based on finding cycles in large random graphs. Such problems are arbitrarily scalable and trivially verifiable. Our implementation uses 1 bit per edge, and up to 1 bit per node. We hypothesize that using significantly less causes superlinear slowdown.
AbstractWe study a new model of computation, called best-order stream, for graph problems. Roughly, ...
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion ...
We design a randomized algorithm that finds a Hamilton cycle in O(n) time with high probability in a...
We introduce the first trivially verifiable, scalable, memory-hard and tmto-hard proof-of-work syste...
We study a design framework for robust, independently verifiable, and workload-balanced distributed ...
The aim of this paper is to extend the analysis of Cuckoo Hashing of Devroye and Morin in 2003. In p...
Cuckoo hashing was introduced by Pagh and Rodler in 2001. Its main feature is that it provides const...
368 pagesInteractive proof systems enable one party (the prover) to convince another (the verifier) ...
There has been significant recent interest in parallel graph processing due to the need to quickly a...
Finding a maximum clique in a graph is one of the most basic computational problems on graphs. The v...
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k ≥ 3...
Propositional proof complexity is a field in theoretical computer science that analyses the resource...
The extent to which a set of related graph-theoretic properties can be used to accont for the superl...
We prove that, unless any problem in NP can be solved in proba-bilistic polynomial time, for any >...
AbstractWe investigate the question of when a verifier, with the aid of a proof, can reliably comput...
AbstractWe study a new model of computation, called best-order stream, for graph problems. Roughly, ...
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion ...
We design a randomized algorithm that finds a Hamilton cycle in O(n) time with high probability in a...
We introduce the first trivially verifiable, scalable, memory-hard and tmto-hard proof-of-work syste...
We study a design framework for robust, independently verifiable, and workload-balanced distributed ...
The aim of this paper is to extend the analysis of Cuckoo Hashing of Devroye and Morin in 2003. In p...
Cuckoo hashing was introduced by Pagh and Rodler in 2001. Its main feature is that it provides const...
368 pagesInteractive proof systems enable one party (the prover) to convince another (the verifier) ...
There has been significant recent interest in parallel graph processing due to the need to quickly a...
Finding a maximum clique in a graph is one of the most basic computational problems on graphs. The v...
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k ≥ 3...
Propositional proof complexity is a field in theoretical computer science that analyses the resource...
The extent to which a set of related graph-theoretic properties can be used to accont for the superl...
We prove that, unless any problem in NP can be solved in proba-bilistic polynomial time, for any >...
AbstractWe investigate the question of when a verifier, with the aid of a proof, can reliably comput...
AbstractWe study a new model of computation, called best-order stream, for graph problems. Roughly, ...
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion ...
We design a randomized algorithm that finds a Hamilton cycle in O(n) time with high probability in a...