Sciweavers

FIWAC
1993
153views Cryptology» more  FIWAC 1993»
13 years 7 months ago
New lower bounds for some spherical designs
A new method for obtaining lower bounds for spherical t-designs is proposed. Applications and new bounds are given for t = 9, 10. Some restrictions on the distribution of the inne...
Peter Boyvalenkov, Svetla Nikova
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
13 years 7 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
FOCS
1994
IEEE
13 years 7 months ago
A Spectral Approach to Lower Bounds
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
Bernard Chazelle
COMPGEOM
1996
ACM
13 years 7 months ago
New Lower Bounds for Convex Hull Problems in Odd Dimensions
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
Jeff Erickson
STOC
1997
ACM
76views Algorithms» more  STOC 1997»
13 years 7 months ago
Exploring Unknown Environments
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
Susanne Albers, Monika Rauch Henzinger
RANDOM
1998
Springer
13 years 7 months ago
"Balls into Bins" - A Simple and Tight Analysis
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
Martin Raab, Angelika Steger
ICCAD
1997
IEEE
131views Hardware» more  ICCAD 1997»
13 years 7 months ago
COSMOS: a continuous optimization approach for maximum power estimation of CMOS circuits
Maximum instantaneous power in VLSI circuits has a great impact on circuit's reliability and the design of power and ground lines. To synthesizehighlyreliablesystems,accurate...
Chuan-Yu Wang, Kaushik Roy
ICCAD
1997
IEEE
118views Hardware» more  ICCAD 1997»
13 years 7 months ago
Global interconnect sizing and spacing with consideration of coupling capacitance
This paper presents an efficient approach to perform global interconnect sizing and spacing (GISS) for multiple nets to minimize interconnect delays with consideration of couplin...
Jason Cong, Lei He, Cheng-Kok Koh, David Zhigang P...
WDAG
1999
Springer
88views Algorithms» more  WDAG 1999»
13 years 8 months ago
Generic Broadcast
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
Fernando Pedone, André Schiper
IPPS
1998
IEEE
13 years 8 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu