Sciweavers

4298 search results - page 796 / 860
» Measurable chromatic numbers
Sort
View
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
14 years 3 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
14 years 3 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
SIGCOMM
1994
ACM
14 years 3 months ago
Improved Algorithms for Synchronizing Computer Network Clocks
The Network Time Protocol (NTP) is widely deployed in the Internet to synchronize computer clocks to each other and to international standards via telephone modem, radio and satel...
David L. Mills
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
14 years 3 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
PET
2010
Springer
14 years 2 months ago
How Unique Is Your Web Browser?
We investigate the degree to which modern web browsers are subject to “device fingerprinting” via the version and configuration information that they will transmit to website...
Peter Eckersley