Algorithmic design, especially for hard problems, is more essential for success in solving
them than any standard improvement of current computer tech nologies. Because of this, the …

Identifying the connected components of a graph, apart from being a fundamental problem
with countless applications, is a key primitive for many other algorithms. In this paper, we …

The book introduces new techniques that imply rigorous lower bounds on the com plexity of
some number-theoretic and cryptographic problems. It also establishes certain attractive …

The goal of this article is to identify fundamental limitations on how efficiently algorithms
implemented on platforms such as MapReduce and Hadoop can compute the central …

This paper introduces the queue-read queue-write (\sc qrqw) parallel random access
machine (\sc pram) model, which permits concurrent reading and writing to shared-memory …

Improving a long chain of works we obtain a randomized EREW PRAM algorithm for finding
the connected components of a graph G=(V, E) with n vertices and m edges in O (log n) time …

We study the relationship between the sizes of two-way finite automata accepting a
language and its complement. In the deterministic case, for a given automaton (2dfa) with n …

We obtain several lower bounds, exponential in terms of lg p, on the degrees of polynomials
and algebraic functions coinciding with values of the discrete logarithm modulo a prime p at …

This paper presents results for the queue-read, queue-write asynchronous parallel random
access machine (qrqw asynchronous pram) model, which is the asynchronous variant of the …

JVe present fast ancl efficient parallel algorithms for fincling the connected components of
an undirected graph. These algorithms run on the exclusive-read, exclusivewrite (13REW) …