Sciweavers

973 search results - page 107 / 195
» New Bounds on Crossing Numbers
Sort
View
TIT
2008
105views more  TIT 2008»
15 years 4 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
IPPS
1995
IEEE
15 years 9 months ago
Data parallel programming in an adaptive environment
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this...
Guy Edjlali, Gagan Agrawal, Alan Sussman, Joel H. ...
SPAA
2005
ACM
15 years 12 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 10 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
ICALP
2009
Springer
16 years 6 months ago
Testing Fourier Dimensionality and Sparsity
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
Parikshit Gopalan, Ryan O'Donnell, Rocco A. Served...