Sciweavers

3047 search results - page 457 / 610
» On the Meaning of Logical Completeness
Sort
View
ECCC
2008
98views more  ECCC 2008»
14 years 10 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
ALGORITHMICA
2006
174views more  ALGORITHMICA 2006»
14 years 10 months ago
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio of the level and ...
Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
COR
2006
72views more  COR 2006»
14 years 10 months ago
Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems
Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system have been reported. Un...
Said Fathy El-Zoghdy, Hisao Kameda, Jie Li
CN
2007
80views more  CN 2007»
14 years 10 months ago
Receiver-centric congestion control with a misbehaving receiver: Vulnerabilities and end-point solutions
Receiver-driven TCP protocols delegate key congestion control functions to receivers. Their goal is to exploit information available only at receivers in order to improve latency ...
Aleksandar Kuzmanovic, Edward W. Knightly
COMBINATORICA
2007
148views more  COMBINATORICA 2007»
14 years 10 months ago
Colored graphs without colorful cycles
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
Richard N. Ball, Ales Pultr, Petr Vojtechovsk&yacu...