Sciweavers

1071 search results - page 185 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
PODC
2005
ACM
14 years 1 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
PODC
2005
ACM
14 years 1 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
UPP
2004
Springer
14 years 1 months ago
Design, Simulation, and Experimental Demonstration of Self-assembled DNA Nanostructures and Motors
Self-assembly is the spontaneous self-ordering of substructures into superstructures driven by the selective affinity of the substructures. DNA provides a molecular scale material...
John H. Reif, Thomas H. LaBean, Sudheer Sahu, Hao ...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
14 years 3 days 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
DIMEA
2007
132views Multimedia» more  DIMEA 2007»
13 years 9 months ago
On the production of creative subjectivity
Businesses today are requiring higher levels of creativity and innovation in the face of rapid change, fierce competition and increasingly complex markets. Nowhere is the more obv...
Brett Rolfe