Sciweavers

4 search results - page 1 / 1
» Independence Results for n-Ary Recursion Theorems
Sort
View
FCT
2009
Springer
13 years 11 months ago
Independence Results for n-Ary Recursion Theorems
The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algo...
John Case, Samuel E. Moelius
COMBINATORICA
2008
92views more  COMBINATORICA 2008»
13 years 5 months ago
A separation theorem in property testing
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
Noga Alon, Asaf Shapira
TACS
1994
Springer
13 years 9 months ago
Full Abstraction for PCF
traction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3 Loyola University Chicago and Pasquale Malacaria4 Queen Mary and Westfield College An intensional m...
Samson Abramsky, Pasquale Malacaria, Radha Jagadee...
INFOCOM
2003
IEEE
13 years 10 months ago
Limit Behavior of ECN/RED Gateways Under a Large Number of TCP Flows
— We consider a stochastic model of an ECN/RED gateway with competing TCP sources sharing the capacity. As the number of competing flows becomes large, the queue behavior at the...
Peerapol Tinnakornsrisuphap, Armand M. Makowski