Sciweavers

STOC
2012
ACM
225views Algorithms» more  STOC 2012»
12 years 2 months ago
An algorithmic characterization of multi-dimensional mechanisms
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
Yang Cai, Constantinos Daskalakis, S. Matthew Wein...
RTAS
2011
IEEE
13 years 4 months ago
A Lookup-Table Driven Approach to Partitioned Scheduling
The partitioned preemptive EDF scheduling of implicitdeadline sporadic task systems on an identical multiprocessor platform is considered. Lookup tables, at any selected degree of...
Bipasa Chattopadhyay, Sanjoy K. Baruah
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
14 years 1 months ago
Deterministic identity testing for multivariate polynomials
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
Richard J. Lipton, Nisheeth K. Vishnoi
SODA
2004
ACM
88views Algorithms» more  SODA 2004»
14 years 1 months ago
Constructing finite field extensions with large order elements
In this paper, we present an algorithm that given a fixed prime power q and a positive integer N, finds an integer n [N, 2qN] and an element Fqn of order greater than 5.8n/ log...
Qi Cheng