Ecien t Strategies for Topics in Internet Algorithmics

[1]  J. Ian Munro,et al.  Deterministic skip lists , 1992, SODA '92.

[2]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[3]  William Pugh,et al.  Skip lists: a probabilistic alternative to balanced trees , 1989, CACM.

[4]  Michael P. Wellman,et al.  A Parametrization of the Auction Design Space , 2001, Games Econ. Behav..

[5]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[6]  David Lucking-Reiley.  AUCTIONS ON THE INTERNET: WHAT'S BEING AUCTIONED, AND HOW?* , 2003 .

[7]  Christian Scheideler,et al.  Improved bounds for the unsplittable flow problem , 2002, SODA '02.

[8]  J. Feigenbaum,et al.  Two new kinds of biased search trees , 1983, The Bell System Technical Journal.

[9]  Uyless D. Black.  MPLS and Label Switching Networks , 2000 .

[10]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[11]  D. West.  Introduction to Graph Theory , 1995 .

[12]  J. Naughton.  A Brief History of the Future: The Origins of the Internet , 1999 .

[13]  Andreas Bley,et al.  On the complexity of vertex-disjoint length-restricted path problems , 2004, computational complexity.

[14]  Laurent Amsaleg,et al.  Dynamic Query Operator Scheduling for Wide-Area Remote Access , 1998, Distributed and Parallel Databases.

[15]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.

[16]  Alberto Marchetti-Spaccamela,et al.  On-line Resource Management with Applications to Routing and Scheduling , 1995, ICALP.

[17]  Funda Ergün,et al.  Biased Skip Lists for Highly Skewed Access Patterns , 2001, ALENEX.

[18]  C. W. Smith.  Auctions: The Social Construction of Value , 1989 .

[19]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[20]  Aravind Srinivasan,et al.  Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems , 2000, Math. Oper. Res..

[21]  Alberto O. Mendelzon,et al.  Database techniques for the World-Wide Web: a survey , 1998, SGMD.

[22]  Kurt Mehlhorn,et al.  A new data structure for representing sorted lists , 1982, Acta Informatica.

[23]  Robert E. Tarjan,et al.  Biased Search Trees , 1985, SIAM J. Comput..

[24]  Tim Roughgarden,et al.  The price of anarchy is independent of the network topology , 2002, STOC '02.

[25]  J. Abbate,et al.  Inventing the Internet , 1999 .

[26]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[27]  Jerry R. Hobbs,et al.  An algebraic approach to IP traceback , 2002, TSEC.

[28]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[29]  Richard A. Luecke,et al.  The ebay Phenomenon: Business Secrets Behind the World's Hottest Internet Company , 2000 .

[30]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[31]  Lawrence G. Roberts,et al.  Beyond Moore's Law: Internet Growth Trends , 2000, Computer.

[32]  Christian Scheideler,et al.  Universal Routing Strategies for Interconnection Networks , 1998, Lecture Notes in Computer Science.

[33]  Jon Kleinberg,et al.  Authoritative sources in a hyperlinked environment , 1999, SODA '98.

[34]  Tim Roughgarden,et al.  Stackelberg scheduling strategies , 2001, STOC '01.

[35]  Alfred V. Aho,et al.  Emerging opportunities for theoretical computer science , 1997, SIGACT News.

[36]  Yossi Azar,et al.  Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms , 1999, SODA '99.

[37]  Eugene L. Lawler,et al.  Parameterized Approximation Scheme for the Multiple Knapsack Problem , 2009, SIAM J. Comput..

[38]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[39]  Jerome H. Saltzer,et al.  End-to-end arguments in system design , 1984, TOCS.

[40]  Heejo Lee,et al.  On the effectiveness of probabilistic packet marking for IP traceback under denial of service attack , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[41]  Amit Kumar,et al.  Approximation Algorithms for the Unsplittable Flow Problem , 2002, APPROX.

[42]  Micah Adler.  Tradeoffs in probabilistic packet marking for IP traceback , 2002, STOC '02.

[43]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[44]  Leonidas J. Guibas,et al.  A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[45]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[46]  Richard J. Lipton,et al.  Online interval scheduling , 1994, SODA '94.

[47]  Kurt Mehlhorn,et al.  Algorithm Design and Software Libraries: Recent Developments in the LEDA Project , 1992, IFIP Congress.

[48]  Christian Scheideler,et al.  Simple on-line algorithms for the maximum disjoint paths problem , 2001, SPAA '01.

[49]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[50]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[51]  Sartaj Sahni,et al.  Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.

[52]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[53]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[54]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[55]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[56]  Paul V. Mockapetris,et al.  Domain names: Concepts and facilities , 1983, RFC.

[57]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[58]  Lorrie Faith Cranor,et al.  Publius: A Robust, Tamper-Evident, Censorship-Resistant, and Source-Anonymous Web Publishing System , 2000, USENIX Security Symposium.

[59]  Norman Abramson,et al.  Information theory and coding , 1963 .

[60]  William J. Cook,et al.  Combinatorial optimization , 1997 .