Experimental Algorithms

s of Invited Talks Provenance for Computational Reproducibility and Beyond

[1]  Patrick K. Nicholson,et al.  A General Framework for Dynamic Succinct and Compressed Data Structures , 2016, ALENEX.

[2]  Gonzalo Navarro,et al.  Practical Dynamic Entropy-Compressed Bitvectors with Applications , 2016, SEA.

[3]  David P. Williamson.  Lecture notes on approximation algorithms: Fall 1998 , 1999 .

[4]  Ya Zhang,et al.  Protein Interaction Inference as a MAX-SAT Problem , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops.

[5]  Gonzalo Navarro,et al.  Succinct Trees in Practice , 2010, ALENEX.

[6]  Roberto Grossi,et al.  High-order entropy-compressed text indexes , 2003, SODA '03.

[7]  J. Stoye,et al.  Dynamic FM-Index for a Collection of Texts with Application to Space-efficient Construction of the Compressed Suffix Array Diplomarbeit im Fach , 2007 .

[8]  Rajeev Raman,et al.  Succinct Dynamic Data Structures , 2001, WADS.

[9]  Shang-Hua Teng,et al.  Smoothed analysis: an attempt to explain the behavior of algorithms in practice , 2009, CACM.

[10]  Gonzalo Navarro,et al.  The wavelet matrix: An efficient wavelet tree for large alphabets , 2015, Inf. Syst..

[11]  Pablo San Segundo,et al.  An improved bit parallel exact maximum clique algorithm , 2013, Optim. Lett..

[12]  Alistair Moffat,et al.  From Theory to Practice: Plug and Play with Succinct Data Structures , 2013, SEA.

[13]  Gonzalo Navarro,et al.  Compressed Dynamic Binary Relations , 2012, 2012 Data Compression Conference.

[14]  Wayne J. Pullan,et al.  Dynamic Local Search for the Maximum Clique Problem , 2011, J. Artif. Intell. Res..

[15]  Guy Jacobson,et al.  Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[16]  Pedro V. Sander,et al.  Efficient traversal of mesh edges using adjacency primitives , 2008, SIGGRAPH 2008.

[17]  David Richard Clark,et al.  Compact pat trees , 1998 .

[18]  Rajeev Raman,et al.  Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets , 2007, ACM Trans. Algorithms.

[19]  Gonzalo Navarro,et al.  Optimal Dynamic Sequence Representations , 2013, SODA.

[20]  Peter Elias,et al.  Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.

[21]  Kunihiko Sadakane,et al.  CRAM: Compressed Random Access Memory , 2010, ICALP.

[22]  Gonzalo Navarro,et al.  Dynamic entropy-compressed sequences and full-text indexes , 2006, TALG.

[23]  Gonzalo Navarro.  Wavelet trees for all , 2014, J. Discrete Algorithms.

[24]  Gonzalo Navarro,et al.  Extended Compact Web Graph Representations , 2010, Algorithms and Applications.

[25]  Gonzalo Navarro,et al.  Improved Range Minimum Queries , 2016, 2016 Data Compression Conference (DCC).

[26]  Pablo San Segundo,et al.  An exact bit-parallel algorithm for the maximum clique problem , 2011, Comput. Oper. Res..

[27]  Kunihiko Sadakane,et al.  Fully Functional Static and Dynamic Succinct Trees , 2009, TALG.

[28]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[29]  Shinya Takahashi,et al.  A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique , 2010, WALCOM.

[30]  Juha Kärkkäinen,et al.  Fixed Block Compression Boosting in FM-Indexes , 2011, SPIRE.

[31]  Ashraf Aboulnaga,et al.  Scalable maximum clique computation using MapReduce , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[32]  Michael E. Saks,et al.  The cell probe complexity of dynamic data structures , 1989, STOC '89.

[33]  Stelios Joannou,et al.  Dynamizing Succinct Tree Representations , 2012, SEA.

[34]  J. IAN MUNRO,et al.  An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time , 1986, J. Comput. Syst. Sci..