Algorithm Theory – SWAT 2014

Online Makespan Minimization with Parallel Schedules.- Expected Linear Time Sorting for Word Size OMEGA(log2 n log log n).- Amortized Analysis of Smooth Quadtrees in All Dimensions.- New Approximability Results for the Robust k-Median Problem.- Approximating the Revenue Maximization Problem with Sharp Demands.- Reconfiguring Independent Sets in Claw-Free Graphs.- Competitive Online Routing on Delaunay Triangulations.- Optimal Planar Orthogonal Skyline Counting Queries.- B-slack Trees: Space Efficient B-Trees.- Approximately Minwise Independence with Twisted Tabulation.- Colorful Bin Packing.- Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques.- Win-Win Kernelization for Degree Sequence Completion Problems.- On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem.- Covering Problems in Edge- and Node-Weighted Graphs.- Colored Range Searching in Linear Space.- Fast Dynamic Graph Algorithms for Parameterized Problems.- Extending Partial Representations of Proper and Unit Interval Graphs.- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams.- Approximate Counting of Matchings in (3,3)-Hypergraphs.

[1]  Monika Henzinger,et al.  Finding near-duplicate web pages: a large-scale evaluation of algorithms , 2006, SIGIR.

[2]  S. Muthukrishnan,et al.  Estimating Rarity and Similarity over Data Stream Windows , 2002, ESA.

[3]  Philipp Woelfel,et al.  Independence of Tabulation-Based Hash Classes , 2011, LATIN.

[4]  Mikkel Thorup,et al.  Twisted Tabulation Hashing , 2013, SODA.

[5]  Mikkel Thorup,et al.  Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[6]  György Turán,et al.  On the performance of on-line algorithms for partition problems , 1989, Acta Cybern..

[7]  Yossi Azar,et al.  On-Line Bin-Stretching , 1998, RANDOM.

[8]  Yuval Rabani,et al.  A Better Lower Bound for On-Line Scheduling , 1994, Inf. Process. Lett..

[9]  Mikkel Thorup,et al.  Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation , 2012, SIAM J. Comput..

[10]  Amos Fiat,et al.  New algorithms for an ancient scheduling problem , 1992, STOC '92.

[11]  Andrei Z. Broder,et al.  On the resemblance and containment of documents , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).

[12]  Ely Porat,et al.  Sketching Techniques for Collaborative Filtering , 2009, IJCAI.

[13]  Dennis Komm,et al.  On the Advice Complexity of the k-Server Problem , 2011, ICALP.

[14]  Alan M. Frieze,et al.  Min-Wise Independent Permutations , 2000, J. Comput. Syst. Sci..

[15]  Mikkel Thorup,et al.  Bottom-k and priority sampling, set similarity and subset sums with minimal independence , 2013, STOC '13.

[16]  Grace Hui Yang,et al.  Near-duplicate detection by instance-level constrained clustering , 2006, SIGIR.

[17]  Piotr Indyk,et al.  A small approximately min-wise independent family of hash functions , 1999, SODA '99.

[18]  Zsolt Tuza,et al.  New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks , 2006, Discret. Math. Theor. Comput. Sci..

[19]  Andrei Z. Broder,et al.  Identifying and Filtering Near-Duplicate Documents , 2000, CPM.

[20]  Larry Carter,et al.  New classes and applications of hash functions , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[21]  Zsolt Tuza,et al.  The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks , 2004, J. Sched..

[22]  T. C. Edwin Cheng,et al.  Semi-on-line multiprocessor scheduling with given total processing time , 2005, Theor. Comput. Sci..

[23]  Susanne Albers,et al.  Better bounds for online scheduling , 1997, STOC '97.

[24]  Daniel Shawcross Wilkerson,et al.  Winnowing: local algorithms for document fingerprinting , 2003, SIGMOD '03.

[25]  Edith Cohen,et al.  Finding interesting associations without support pruning , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[26]  Chih-Jen Lin,et al.  LIBLINEAR: A Library for Large Linear Classification , 2008, J. Mach. Learn. Res..

[27]  Gurmeet Singh Manku,et al.  Detecting near-duplicates for web crawling , 2007, WWW '07.

[28]  Mikkel Thorup,et al.  On the k-Independence Required by Linear Probing and Minwise Independence , 2010, TALG.

[29]  Geoffrey Zweig,et al.  Syntactic Clustering of the Web , 1997, Comput. Networks.

[30]  Ely Porat,et al.  Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems , 2009, SPIRE.

[31]  Albert L. Zobrist,et al.  A New Hashing Method with Application for Game Playing , 1990 .

[32]  Ojas Parekh,et al.  Approximation algorithms for partially covering with edges , 2008, Theor. Comput. Sci..

[33]  Debmalya Panigrahi,et al.  Survivable network design problems in wireless networks , 2011, SODA '11.

[34]  Ping Li,et al.  Hashing Algorithms for Large-Scale Learning , 2011, NIPS.

[35]  Yossi Azar,et al.  On-line load balancing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[36]  Zsolt Tuza,et al.  Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items , 2003, Algorithmica.

[37]  Pierre Fraigniaud,et al.  Online computation with advice , 2009, Theor. Comput. Sci..