The documents listed below have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
1.
The Confluent Capacity of the Internet:
Congestion vs. Dilation
with J. Chen, M. V. Marathe and R. Rajaraman.
Accepted
to IEEE ICDCS 2006. (Best Paper Award)
Simple
randomized scheme for achieving confluent flow with near optimal congestion and
dilation in preferential attachment graphs.
2.
(Almost) Tight bounds and existence theorems for
confluent flows
with J. Chen, R. Kleinberg, L. Lovasz, R. Rajaraman and A. Vetta.
Symposium on Theory of Computing (STOC), pp. 529-538, 2004. The
paper is accepted to the Journal of the
ACM.
Tight upper and lower (log
n) bounds on the congestion of a confluent flow are proved.
3.
Meet and merge: approximation algorithms for
confluent flows
with J. Chen and R. Rajaraman.
Symposium on Theory of Computing (STOC), pp. 373-382, 2003. The
paper was invited to, and appeared in, a special issue of the Journal of Computer Systems and Sciences 72(3),
pp. 468-489, 2006.
The notion of a confluent flow, introduced in this paper, characterizes Internet flows. A constant factor hardness result and a Ön approximation algorithm are presented for the minimum congestion of a confluent flow.
4.
Group-independent Spanning Tree for Data
Aggregation in Dense Sensor Networks
with L. Jia, G. Noubir and
R. Rajaraman.
Accepted to DCOSS, 2006.
Universal algorithm and associated protocol for data aggregation in
sensor networks embedded on the plane.
5.
Universal approximations for TSP, Steiner tree
and set cover
with L. Jia, G. Lin, G.
Noubir and R. Rajaraman.
Symposium on Theory of Computing (STOC), pp. 386-395, 2005.
A
Sigma-2 model for approximation algorithms. Polylog approximation algorithms
for metric TSP and Steiner tree.
6.
Scaling Laws for the Internet over Urban
Regions
with V. S. Anil Kumar, M.
Marathe, M. Thakur and
Accepted to CAIDA’s ISMA WIT, (Short Paper) 2006.
A study of the topology of
the Internet over metropolitan areas.
7. Towards a Topology Generator Modeling
AS Relationships
with X. Dimitropoulos, G.
Riley and D. Krioukov.
Proceedings of IEEE International Conference on Network
Protocols (ICNP), (Short Paper) 2006.
A generator for AS-level
graphs that captures inter-AS relationships.
8.
A methodology for estimating
inter-domain web traffic demand
with A. Feldmann, O. Maennel, N. Kammenhuber, B. Maggs and R. de Prisco.
Internet Measurement Conference (IMC), pp. 322-335, 2004.
Estimation of inter-domain
traffic combining CDN data with trace data.
9.
Minimum energy accumulative routing in wireless
networks
with J. Chen, L. Jia, X.
Liu and G. Noubir.
Proceedings of INFOCOM, vol. 3, pp. 1875-1886, 2005.
Bounds (upper and lower) on
accumulative energy routing.
10.
Managing a portfolio of overlay paths
with D. Antonova, A. Krishnamurthy and Z. Ma.
Proceedings of Networking and Operating Systems Support for
Digital Audio and Video (NOSSDAV),
pp. 30-35, 2004.
A mean-variance framework
for optimizing overlay paths.
11.
Improving minimum cost spanning trees by upgrading
nodes
with S.O. Krumke, M.V. Marathe, H. Noltemeier, R. Ravi, S.S. Ravi
and H-C. Wirth. Journal of
Algorithms, 33(1), pp. 92-111, 1999.
12.
Improving spanning trees by upgrading nodes
with S.O. Krumke, M.V. Marathe, H. Noltemeier, R. Ravi, S.S. Ravi
and H-C. Wirth. Theoretical
Computer Science, 221(1-2), pp. 139-155, 1999. A preliminary version
appeared in International Colloquium on
Automata, Languages and Programming (ICALP), LNCS 1256, pp. 281-291, 1997.
13.
Bicriteria network design problems
with M.V. Marathe, R. Ravi, S.S. Ravi, D. Rosenkrantz and H. Hunt.
Journal of Algorithms, 28(1), pp. 142-171, 1998. A preliminary version
appeared in International Colloquium on
Automata, Languages and Programming (ICALP), LNCS 944, pp. 487-498, 1995.
14.
Improved results on service-constrained
network design problems
with M.V. Marathe and R. Ravi.
Network Design: Connectivity and Facilities Location, P.M. Pardalos and D.Z. Du,
editors, DIMACS Series, Vol. 40, AMS, pp. 269-276, 1998.
with R. Panigrahy,
Information Processing Letters, 62, pp. 295-300, 1997.
16.
Service-constrained network design problems
with M. V. Marathe and
R. Ravi.
Nordic Journal of Computing, 3(4), pp. 367-387, 1996. A preliminary version
appeared in Scandinavian Workshop on
Algorithm Theory (SWAT), LNCS 1097, pp. 28-40, 1996.
17.
Spanning trees short or small
with R. Ravi, M.V.
Marathe, D. Rosenkrantz and S.S. Ravi.
18.
On completing Latin Squares
with Iman Hajirasouliha, Hossein Jowhari
and
Symposium on Theoretical Aspects of Computer Science (STACS), 2007.
19.
Approximating Latin square extensions
with
Algorithmica, 24(2), pp. 128-138, 1999. A preliminary version appeared in International Conference on Computation and
Combinatorics (COCOON), LNCS 1090, pp. 280-289, 1996.
20.
Faster algorithms for optical switch configurations
with
IEEE International Conference on Communications (ICC), pp. 1320-1324, 1997.
21.
A Game-Theoretic Framework for Bandwidth
Attacks and Statistical Defenses
with M. Snyder and M. Thakur.
To
appear in Proceedings of IEEE LCN (Local Computer Networks) Conference, 2007.
22.
SPREAD: Foiling Jammers using Multi-Layer Agility
with X. Liu, G. Noubir and S. Tan.
Proceedings of INFOCOM Minisymposium, 2007.
Idea for foiling jammers by
mechanism hopping across layers using cryptographic coordination.
23.
Steganographic Communication in
Ordered Channels
with
Proceedings of Information Hiding, IH2006, LNCS, 2006.
Estimation of the amount of
information that can be embedded in the sequencing of packets in an ordered
channel, such as TCP. Optimal codes with encoding/decoding algorithms are
provided and an open problem due to Lehmer is resolved.
with R. Gennaro, D. Leigh and W. Yerazunis.
Proceedings of AsiaCrypt, LNCS pp. 276-292,
2004.
A generalization of
Schnorr’s zero knowledge scheme to multiple identities is presented. Details of
a smart card implementation using bi-directional LEDs are given. The scheme
allows for an efficient transfer of privileges from one smart card to another.
25.
Alternation in interaction
with M. Kiwi, C. Lund,
A. Russell and D. Spielman.
Computational Complexity, 9(3-4), pp. 202-246, 2000. A preliminary version
appeared in IEEE Conference on Structure
in Complexity Theory, pp. 294-303, 1994.
26.
A note on the asymptotics and
computational complexity of graph distinguishability
with A. Russell.
Electronic
Journal of Combinatorics, 5(1), R23, 1998.
27.
Symmetric alternation captures BPP
with A. Russell.
Computational Complexity, 7(2), pp. 152-162, 1998. A preliminary version
appeared in Workshop on Interactive Proof
Systems, Weizmann Institute, Israel, 1995.
We introduce S2 –
a complexity class that captures symmetric alternation and prove a number of
interesting facts about this class. Ran Canetti independently discovered S2.
Later Cai proved a very interesting result about this class and Sengupta
observed that in the tightest form of the famous Karp-Lipton theorem, the
polynomial-time hierarchy collapses to S2. Read all about it in
Lance Fortnow’s complexity theory blog where it attained the status of “complexity
class of the week” for the week of August 28, 2002.
28.
The relationship between probabilistically
checkable debate systems, IP and PSPACE
with A. Russell.
Information Processing Letters, 53(2), pp. 61-68, 1995.
29. MOVARTO: Virtual Server Migration across
Networks using DNS and Route Triangulation
with
VMWorld 2007.
Extends the concept of OS virtualization
to network virtualization.
30.
Unweaving a web of documents
with R. Guha,
Proceedings of Knowledge Discovery and Data Mining (KDD),
pp. 574-579, (Short Paper) 2005.
Algorithms for decomposing a
collection of time-stamped documents into threads.
31.
Expressiveness and complexity of
crosscut languages
with K. Lieberherr and J.
Palm.
Accepted to FOAL, 2005.
Algorithms and hardness
results for a class of crosscut languages.
32.
A note on embedding complete graphs into
hypercubes
with M. Klugerman and
A. Russell.
Discrete Mathematics, 186, pp. 1-3, 1998.
It is shown that complete
graphs of size n can be embedded into hypercubes so as to minimize the sum of
edge dilations in a uniform way for all n except n =4 and n = 8. This explains
the anomalous factor of approximation obtained for a natural algorithm for the
multicut problem. This was the first paper to give me an Erdos number of 2;
Mike Klugerman has coauthored a paper with Erdos.
33.
Treewidth of circular-arc graphs
with K.S. Singh and
C.P. Rangan.
Treewidth is a graph measure
defined by Robertson and Seymour in the course of their celebrated graph minor
project. The treewidth of a graph characterizes the complexity of many
computational problems on that graph. Here we present the first polynomial time
algorithms for computing the treewidth of the class of intersection graphs of
arcs on a circle.
34.
Efficient parallel shuffle recognition
with M. Nivat, G.D.S.
Ramkumar, C.P. Rangan and A. Saoudi.
Parallel Processing Letters, 4(4), pp. 455-463, 1994. A preliminary version
appeared in International Parallel
Processing Symposium (IPPS), pp. 112-115, 1992.
35.
Optimal path cover problem on block graphs
and bipartite permutation graphs
with R. Srikant, K.S. Singh and C.P. Rangan.
Theoretical Computer Science, 115(2), pp. 351-357, 1993.
This paper presents the first polynomial-time algorithms for minimizing the number of paths needed to cover block graphs and bipartite permutation graphs.