Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Sundaram, Ravi - College of Computer Science, Northeastern University
Expressiveness and Complexity of Crosscut Languages Karl J. Lieberherr
Approximating Latin Square Extensions S. Ravi Kumar
Spanning Trees Short or Small R. Ravi* R. Sundaramt M. V. Marathet D. J. Rosenkrantz 0 S. S. Ravin
Z .Journal of Algorithms 33, 92 111 1999 Article ID jagm.1999.1021, available online at http:rrwww.idealibrary.com on
Spanning trees short or small R. Raviy R. Sundaramz M. V. Marathex D. J. Rosenkrantz{
Faster Algorithms for Optical Switch Configuration S Ravi Kumar
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
(Almost) Tight Bounds and Existence Theorems for Confluent Flows
In recent years there has been renewed interest in the problem of transferring bulk data (terabytes) utilizing commercial ISPs.
A Methodology for Estimating Interdomain Web Traffic Demand
A Note on Optical Routing on Trees S. Ravi Kumara;1
Future IP-based Airborne Networks, important components in net-centric military communications, are envisioned to consist of
Batching Schnorr Identification Scheme with Applications to Privacy-Preserving
Symmetric Alternation Captures BPP Alexander Russell
The Relativized Relationship between Probabilistically Checkable Debate Systems, IP and PSPACE
Unweaving a Web of Documents IBM Almaden Research Center
A Note on Embedding Complete Graphs into Michel Goemans Michael Klugermany
Nordic Journal of Computing SERVICE-CONSTRAINED NETWORK DESIGN
Alternation in Interaction MIT & U. Chile
Home is Where the (Fast) Internet is: Flat-rate Compatible Incentives for Reducing Peak Load
Managing a Portfolio of Overlay Paths Daria Antonova
Capacitated Caching Games Ragavendran Gopalakrishnan
The Confluent Capacity of the Internet: Congestion vs. Dilation Jiangzhuo Chen
Thcorctic.11 Computer Scicncc 115 119931351-357 Optimal path cover problem on
A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses
MOVARTO: Server Migration across Networks using Route Triangulation and DNS
Scaling Laws for the Internet Over Urban Regions V.S. Anil Kumar Madhav V. Marathe
A Note on the Asymptotics and Computational Complexity of Graph Distinguishability
Meet and Merge: Approximation Algorithms for Confluent Jiangzhuo Chen
Preprocessing DNS Log Data for Effective Data Mining