Nick Reingold

According to our database1, Nick Reingold authored at least 22 papers between 1991 and 2004.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2004
OPT Versus LOAD in Dynamic Storage Allocation.
SIAM J. Comput., 2004

2001
Deriving traffic demands for operational IP networks: methodology and experience.
IEEE/ACM Trans. Netw., 2001

2000
NetScope: traffic engineering for IP networks.
IEEE Netw., 2000

Generating adversaries for request-answer games.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Competitive On-Line Algorithms for Distributed Data Management.
SIAM J. Comput., 1999

Paging Against a Distribution and IP Networking.
J. Comput. Syst. Sci., 1999

1997
Page Migration Algorithms Using Work Functions.
J. Algorithms, 1997

A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem.
Inf. Process. Lett., 1997

1996
Off-Line Algorithms for the List Update Problem.
Inf. Process. Lett., 1996

PP is Closed Under Truth-Table Reductions.
Inf. Comput., 1996

1995
An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-Over-ATM Networks.
IEEE J. Sel. Areas Commun., 1995

PP Is Closed under Intersection.
J. Comput. Syst. Sci., 1995

Balanced Allocations for Tree-Like Inputs.
Inf. Process. Lett., 1995

Adaptive Hodling Policies for IP over ATM Networks.
Proceedings of the Proceedings IEEE INFOCOM '95, 1995

1994
Randomized Competitive Algorithms for the List Update Problem.
Algorithmica, 1994

Linear Programs for Randomized On-Line Algorithms.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

IP over connection-oriented networks and distributional paging
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

On-Line Distributed Data Management.
Proceedings of the Algorithms, 1994

1992
Games I/O Automata Play (Extended Abstract).
Proceedings of the CONCUR '92, 1992

1991
PP Is Closed Under Intersection (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Randomized Competitive Algorithms for the List Update Problem.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

The Perceptron Strikes Back.
Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991


  Loading...