Algorithms and Data Structures

s of Invited Lectures Algorithms for Geometric Similarity: Recent Developments

[1]  Yossi Azar,et al.  On-line generalized Steiner problem , 1996, SODA '96.

[2]  Friedhelm Meyer auf der Heide,et al.  Towards the price of leasing online , 2016, J. Comb. Optim..

[3]  Arnold L. Rosenberg,et al.  Work-preserving emulations of fixed-connection networks , 1989, STOC '89.

[4]  Amos Fiat,et al.  Competitive distributed file allocation , 1993, STOC '93.

[5]  Randy H. Katz,et al.  Above the Clouds: A Berkeley View of Cloud Computing , 2009 .

[6]  Desh Ranjan,et al.  Upper and lower I/O bounds for pebbling r-pyramids , 2012, J. Discrete Algorithms.

[7]  Lorenzo De Stefani,et al.  The I/O Complexity of Strassen's Matrix Multiplication with Recomputation , 2016, WADS.

[8]  Adam Meyerson.  The parking permit problem , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[9]  Noga Alon,et al.  On-line steiner trees in the Euclidean plane , 1992, SCG '92.

[10]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[11]  David L. Black,et al.  Competitive algorithms for replication and migration problems , 1989 .

[12]  Raouf Boutaba,et al.  A survey of network virtualization , 2010, Comput. Networks.

[13]  Spyros Angelopoulos.  On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems , 2009, WAOA.

[14]  Makoto Imase,et al.  Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..

[15]  Barbara M. Anthony,et al.  Infrastructure Leasing Problems , 2007, IPCO.

[16]  Rudolf Fleischer,et al.  New results for online page replication , 2000, Theor. Comput. Sci..

[17]  D. Grigor'ev.  Application of separability and independence notions for proving lower bounds of circuit complexity , 1980 .

[18]  François Le Gall,et al.  Faster Algorithms for Rectangular Matrix Multiplication , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[19]  Jeffery R. Westbrook,et al.  The Performance of greedy algorithms for the on-line steiner tree and related problems , 2005, Mathematical systems theory.

[20]  Susanne Albers,et al.  New On-Line Algorithms for the Page Replication Problem , 1994, SWAT.

[21]  John E. Savage,et al.  Models of computation - exploring the power of computing , 1998 .

[22]  Carsten Lund,et al.  Competitive On-Line Algorithms for Distributed Data Management , 1999, SIAM J. Comput..

[23]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[24]  David P. Williamson,et al.  Offline and online facility leasing , 2013, Discret. Optim..

[25]  Friedhelm Meyer auf der Heide,et al.  Randomized Online Algorithms for Set Cover Leasing Problems , 2014, COCOA.

[26]  Yossi Azar,et al.  Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[27]  Andrea Pietracaprina,et al.  On the Space and Access Complexity of Computation DAGs , 2000, WG.

[28]  Seeun Umboh.  Online Network Design Algorithms via Hierarchical Decompositions , 2015, SODA.

[29]  Akira Matsubayashi.  Non-greedy Online Steiner Trees on Outerplanar Graphs , 2016, WAOA.

[30]  Geppino Pucci,et al.  Area-time tradeoffs for universal VLSI circuits , 2008, Theor. Comput. Sci..

[31]  Yuval Rabani,et al.  Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..