Amitabha Bagchi  Home/Search
Context
Related
| poly.edu/~bagchi/phdthesis.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: poly.edu/~bagchi/ (more) Homepages: A.Bagchi |
Rate this article:      (best)Comment on this article |
Abstract: In this dissertation we posit a coherent area of research called Internet Algorithmics. We study a number of different algorithmic problems which are motivated by or are relevant to the various processes which activate the Internet or are activated by it. The first problem is that of auctioning... (Update)
Similar documents (at the sentence level): More
64.1%: Efficient Strategies for Topics in Internet Algorithmics - Bagchi (2002) (Correct)
8.0%: Seller-Focused Algorithms for Online Auctioning - Bagchi, Chaudhary, Garg.. (2001) (Correct)
6.5%: Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (2004) (Correct)
Active bibliography (related documents): More All
0.3: Improved Bounds for the Unsplittable Flow Problem - Kolman, Scheideler (2004) (Correct)
0.3: What Does the Future Hold for Theoretical Computer Science? - Sannella (Correct)
0.3: Tutorial Reading List - Jacob (1999) (Correct)
Similar documents based on text:
0.3: Deterministic Sampling and Range Counting in.. - Bagchi, Chaudhary, .. (2004) (Correct)
0.2: Short Length Menger's Theorem and Reliable Optical Routing - Bagchi, Chaudhary, Kolman (2003) (Correct)
BibTeX entry: (Update)
@phdthesis{ bagchi-efficient,
author = "Amitabha Bagchi",
title = "Efficient Strategies for Topics in Internet Algorithmics",
url = "citeseer.ist.psu.edu/bagchi02efficient.html" }
Citations (may not include all citations):1225 Chord: A scalable peer-to-peer lookup service for Internet a.. - Stoica, Morris et al. - 2001
1065 Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1996
1023 A scalable content-addressable network - Ratnasamy, Francis et al. - 2001
837 Cambridge University Press (context) - Motwani, Raghavan - 1995
624 Computer Networks (context) - Tanenbaum - 1996
576 Authoritative sources in a hyperlinked environment - Kleinberg - 1999
423 End-to-end arguments in system design - Saltzer, Reed et al. - 1984
411 Freenet: A distributed anonymous information storage and ret.. - Clarke, Wiley et al. - 2009
326 Multiprotocol label switching architecture (context) - Rosen, Viswanathan et al. - 2001
318 Approximation Algorithms for NP-Hard Problems (context) - Hochbaum - 1997
280 Online Computation and Competitive Analysis (context) - Borodin, El-Yaniv - 1998
206 Consistent hashing and random trees: Distributed caching pro.. - Karger, Lehman et al. - 1997
198 Database techniques for the world wide web: A survey - Florescu, Levy et al. - 1998
192 Self-adjusting binary search trees (context) - Sleator, Tarjan - 1985
184 Computationally manageable combinatorial auctions - Rothkopf, Pekec et al. - 1998
182 Skip lists: A probabilistic alternative to balanced trees - Pugh - 1990
182 Skip lists: A probabilistic alternative to balanced trees - Pugh - 1990
168 Introduction to Graph Theory (context) - West - 1996
152 Probabilistic computations: Towards a unified measure of com.. (context) - Yao - 1977
133 Throughput-competitive on-line routing - Awerbuch, Azar et al. - 1993
124 A dichromatic framework for balanced trees (context) - Guibas, Sedgewick - 1978
118 Competitive nonpreemptive call-control - Awerbuch, Bartal et al. - 1994
85 Worst-case equilibria - Koutsoupias, Papadimitriou - 1999
84 Combinatorial Optimization (context) - Cook, Cunningham et al. - 1997
73 Online interval scheduling - Lipton, Tomkins - 1994
72 An algebraic approach to IP Traceback - Dean, Franklin et al. - 2001
67 A new data structure for representing sorted lists (context) - Huddleston, Mehlhorn - 1982
65 web publishing system (context) - Waldman, Rubin et al. - 2000
62 Approximation Algorithms for Disjoint Paths Problems - Kleinberg - 1996
54 Problems and results on 3-chromatic hypergraphs and some rel.. (context) - Erdos, Lovasz - 1975
51 Near-optimal hardness results and approximation algorithms f.. - Guruswami, Khanna et al. - 1999
47 Information Theory and Coding (context) - Abramson - 1963
43 Modern Graph Theory (context) - Bollobas - 1998
43 Randomized search trees - Seidel, Aragon - 1996
41 Fast approximation algorithms for knapsack problems (context) - Lawler - 1977
34 Approximation algorithms for disjoint paths and related rout.. (context) - Baveja, Srinivasan - 2000
33 Biased search trees (context) - Bent, Sleator et al. - 1985
30 A parametrization of the auction design space - Wurman, Wellman et al. - 2001
27 Universal Routing Strategies for Interconnection Networks (context) - Scheideler - 1998
24 The price of anarchy is independent of the network topology - Roughgarden - 2002
21 Stackelberg scheduling strategies - Roughgarden - 2001
20 the complexity of vertex-disjoint length-restricted path pro.. - Bley - 1998
20 Improved bounds for the unsplittable flow problem - Kolman, Scheideler - 2002
19 Dynamic query operator scheduling for wide-area remote acces.. - Amsaleg, Franklin et al. - 1998
17 Algorithm design and software libraries: Recent developments.. - Mehlhorn, Naher - 1992
15 Beyond Moore's law: Internet growth trends (context) - Roberts - 2000
15 Deterministic skip lists (context) - Munro, Papadakis et al. - 1992
13 Beating the logarithmic lower bound: randomized preemptive d.. - Adler, Azar - 1999
12 A distributed decentralized information storage and retrieva.. (context) - Clarke - 1999
11 line resource management with applications to routing and sc.. - Leonardi, Marchetti-Spaccamela - 1995
11 ectiveness of probabilistic packet marking for IP traceback .. (context) - Park, Lee - 2001
10 routing-based on-line algorithms for maximum disjoint paths .. (context) - Kolman, Scheideler - 2001
9 Approximation algorithms for the 0/1 knapsack problem (context) - Sahni - 1975
8 Inventing the Internet (context) - Abbate - 1999
7 Internet domain survey (context) - Consortium - 2002
6 Two new kinds of biased search trees (context) - Feigenbaum, Tarjan - 1983
6 An algorithm for the organisation of information (context) - Adel'son-Vel'skii, Landis - 1962
6 Auctions: The Social Construction of Value (context) - Smith - 1989
6 Approximation algorithms for the unsplittable flow problem - Chakrabarti, Chekuri et al. - 2002
6 Biased dictionarie with fast insertdelete (context) - Sharp, dictionaries et al. - 2001
5 Biased skip lists for highly skewed access patterns - Ergun, Sahinalp et al. - 2001
5 Prentice Hall Series in Advanced Communications Technologies (context) - Black, Label - 2001
5 Blindly competitive algorithms for pricing and bidding (context) - Awerbuch, Azar
5 in probabilistic packet marking for ip traceback (context) - Adler - 2002
5 Fast approximation algorithms for the knapsack and subset su.. (context) - Ibarra, Kim - 1975
3 A Brief History of the Future: The origins of the Internet (context) - Naughton - 1999
3 and Contracting: Uses and Theory (context) - Engelbrecht-Wiggans, Shubik et al. - 1983
3 Emerging opportunities for theoretical computer science - Aho, Johnson et al. - 1996
2 The eBay Phenomenon: Business secrets behind the world's hot.. (context) - Bunnell - 2000
2 Experts list challenges facing Internet growth in Nigeria (context) - Aginam - 2001
2 Computer Resource Management (context) - Odlyzko, Myth et al. - 2001
2 Journal of Industrial Economics (context) - Lucking-Reilly, the - 2000
2 Distributed Geographic Informations Systems on the Web (context) - Wang - 2000
2 A Committee formed by the Computer Science and Telecommunica.. (context) - the, the et al. - 2001
2 Architectural principles of the Internet (context) - Board, Group et al.
2 IAB technical comment on the unique DNS root (context) - Board - 2000
2 Skip lists: Implementation e#ects on the Spread Group Commun.. (context) - Schlossnagle
2 Available online httpwww (context) - names, facilities et al. - 1983
2 Ab ke ham bichhde (context) - Faraaz - 1965
2 Who is at the door: The SYN denial of service (context) - Stewart, Maginnis et al. - 1997
2 Personal Communication (context) - Schlossnagle - 2002
1 Available online httpwww (context) - Agogbua, McManus et al. - 1999
http://www.anamorph.com/docs/stats/stats.html
http://www.sasianet.org/telecominfrastr.html
http://www.research.att.com/
http://www.mids.org/
http://www.spread.org
http://www.cicso.com/warp/public/707/22.html
http://www.napster.com/
http://www.netsizer.com/
http://www.census.gov/
http://www.limewire.com/index.jsp/p2p
http://grc.com/dos/grcdos.htm
Documents on the same site (http://cis.poly.edu/~bagchi/): More
Algorithms for Fault-Tolerant Routing in Circuit.. - Bagchi.. (2002) (Correct)
Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (2004) (Correct)
Short Length Menger's Theorem and Reliable Optical Routing - Bagchi, Chaudhary, Kolman (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC