AbstractWe prove a tight lower bound of Ω(log log n) in the parallel decision tree model, on the complexity of searching the d-dimensional cube of side n using nd−1 processors. The lower bound is valid even for randomized algorithms which err with constant probability
The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel with ...
AbstractUsing the parallel comparison tree model of Valiant, we study the time required in the worst...
AbstractThis paper gives output-sensitive parallel algorithms whose performance depends on the outpu...
AbstractWe prove a tight lower bound of Ω(log log n) in the parallel decision tree model, on the com...
AbstractWe show that in the deterministic comparison model for parallel computation, p = n processor...
AbstractWe present lower bounds on the number of rounds required to solve a decision problem in the ...
AbstractThis paper studies parallel search algorithms within the framework of independence systems. ...
AbstractWe present a simple deterministic parallel algorithm that runs on a CRCW PRAM and sorts n in...
AbstractSeveral articles have noted the usefulness of a retrieval algorithm called sequential interp...
There are a number of fundamental problems in computational geometry for which work-optimal algorith...
AbstractIn this paper we give improved bounds for the multisearch problem on a hypercube. This is a ...
The all nearest smaller values problem is defined as follows. Let A = (a 1 ; a 2 ; : : : ; an ) be n...
AbstractWe prove new lower bounds for nearest neighbor search in the Hamming cube. Our lower bounds ...
We show that any parallel algorithm in the fixed degree algebraic decision tree model that answers m...
In this paper we examine parallel algorithms for performing a depth-first search (DFS) of a directed...
The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel with ...
AbstractUsing the parallel comparison tree model of Valiant, we study the time required in the worst...
AbstractThis paper gives output-sensitive parallel algorithms whose performance depends on the outpu...
AbstractWe prove a tight lower bound of Ω(log log n) in the parallel decision tree model, on the com...
AbstractWe show that in the deterministic comparison model for parallel computation, p = n processor...
AbstractWe present lower bounds on the number of rounds required to solve a decision problem in the ...
AbstractThis paper studies parallel search algorithms within the framework of independence systems. ...
AbstractWe present a simple deterministic parallel algorithm that runs on a CRCW PRAM and sorts n in...
AbstractSeveral articles have noted the usefulness of a retrieval algorithm called sequential interp...
There are a number of fundamental problems in computational geometry for which work-optimal algorith...
AbstractIn this paper we give improved bounds for the multisearch problem on a hypercube. This is a ...
The all nearest smaller values problem is defined as follows. Let A = (a 1 ; a 2 ; : : : ; an ) be n...
AbstractWe prove new lower bounds for nearest neighbor search in the Hamming cube. Our lower bounds ...
We show that any parallel algorithm in the fixed degree algebraic decision tree model that answers m...
In this paper we examine parallel algorithms for performing a depth-first search (DFS) of a directed...
The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel with ...
AbstractUsing the parallel comparison tree model of Valiant, we study the time required in the worst...
AbstractThis paper gives output-sensitive parallel algorithms whose performance depends on the outpu...
DOI
Add to ORKG