Join Our Newsletter

SODA

2012

ACM

7 years 23 days ago
2012

ACM

We give a deterministic algorithm to ﬁnd the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...

ESA

2011

Springer

7 years 10 months ago
2011

Springer

In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...

CORR

2010

Springer

8 years 5 months ago
2010

Springer

We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...

CORR

2011

Springer

8 years 5 months ago
2011

Springer

Wigderson and Xiao presented an eﬃcient derandomization of the matrix Chernoﬀ bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...

IPL

2010

8 years 8 months ago
2010

In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...

MOC

2002

8 years 10 months ago
2002

In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...

JACM

2000

8 years 10 months ago
2000

A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...

ECCC

2000

8 years 10 months ago
2000

Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...

PC

2008

8 years 10 months ago
2008

In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communica...

FOCM

2008

8 years 10 months ago
2008

Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...