| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Süleyman Cenk Sahinalp Funda Ergün , S. Muthukrishnan , Süleyman Cenk Sahinalp: Sublinear Methods for Detecting Periodic Trends in Data Streams. LATIN 2004 : 16-28 Funda Ergün , S. Muthukrishnan , Süleyman Cenk Sahinalp: Comparing Sequences with Segment Rearrangements. FSTTCS 2003 : 183-194 Süleyman Cenk Sahinalp, Murat Tasan , Jai Macker , Z. Meral Özsoyoglu : Distance Based Indexing for String Proximity Search. ICDE 2003 : 125- Süleyman Cenk Sahinalp, Evan E. Eichler , Paul W. Goldberg , Petra Berenbrink , Tom Friedetzky , Funda Ergün : Statistical Identification of Uniformly Mutated Segments within Repeats. CPM 2002 : 249-261 S. Muthukrishnan , Süleyman Cenk Sahinalp: Simple and Practical Sequence Nearest Neighbors with Block Operations. CPM 2002 : 262-278 S. Muthukrishnan , Süleyman Cenk Sahinalp: An Improved Algorithm for Sequence Comparison with Block Reversals. LATIN 2002 : 319-325 Funda Ergün , Süleyman Cenk Sahinalp, Jonathan Sharp , Rakesh K. Sinha : Biased Skip Lists for Highly Skewed Access Patterns. ALENEX 2001 : 216-230 Graham Cormode , S. Muthukrishnan , Süleyman Cenk Sahinalp: Permutation Editing and Matching via Embeddings. ICALP 2001 : 481-492 Funda Ergün , Suvo Mittra , Süleyman Cenk Sahinalp, Jonathan Sharp , Rakesh K. Sinha : A Dynamic Lookup Scheme for Bursty Access Patterns. INFOCOM 2001 : 1444-1453 Funda Ergün , Süleyman Cenk Sahinalp, Jonathan Sharp , Rakesh K. Sinha : Biased dictionaries with fast insert/deletes. STOC 2001 : 483-491 Yossi Matias , Nasir Rajpoot , Süleyman Cenk Sahinalp: The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression. ACM Journal of Experimental Algorithms 6 : 10 (2001) Leslie Ann Goldberg , Paul W. Goldberg , Mike Paterson , Pavel A. Pevzner , Süleyman Cenk Sahinalp, Elizabeth Sweedyk : The Complexity of Gene Placement. J. Algorithms 41 (2): 225-243 (2001) Z. Cohen , Yossi Matias , S. Muthukrishnan , Süleyman Cenk Sahinalp, Jacob Ziv : On the temporal HZY compression scheme. SODA 2000 : 185-186 Graham Cormode , Mike Paterson , Süleyman Cenk Sahinalp, Uzi Vishkin : Communication complexity of document exchange. SODA 2000 : 197-206 S. Muthukrishnan , Süleyman Cenk Sahinalp: Approximate nearest neighbors and sequence comparison with block operations. STOC 2000 : 416-424 Yossi Matias , Nasir Rajpoot , Süleyman Cenk Sahinalp: The Effect of Flexible Parsing for Dynamic Dictionary Based Data Compression. Data Compression Conference 1999 : 238-246 Andrew V. Goldberg , Paul W. Goldberg , Pavel A. Pevzner , Süleyman Cenk Sahinalp, Elizabeth Sweedyk , Andrew V. Goldberg , Kostas Tsioutsiouliklis : Cut Tree Algorithms. SODA 1999 : 376-385 Leslie Ann Goldberg , Paul W. Goldberg , Mike Paterson , Pavel A. Pevzner , Süleyman Cenk Sahinalp, Elizabeth Sweedyk : The Complexity of Gene Placement. SODA 1999 : 386-395 Yossi Matias , Süleyman Cenk Sahinalp: On the Optimality of Parsing in Dynamic Dictionary Based Data Compression. SODA 1999 : 943-944 S. Muthukrishnan , Mike Paterson , Süleyman Cenk Sahinalp, Torsten Suel : Compact Grid Layouts of Multi-Level Networks. STOC 1999 : 455-463 Yossi Matias , Nasir Rajpoot , Süleyman Cenk Sahinalp: Implementation and Experimental Evaluation of Flexible Parsing for Dynamic Dictionary Based Data Compression. Algorithm Engineering 1998 : 49-61 Yossi Matias , S. Muthukrishnan , Süleyman Cenk Sahinalp, Jacob Ziv : Augmenting Suffix Trees, with Applications. ESA 1998 : 67-78 Shimon Even , S. Muthukrishnan , Mike Paterson , Süleyman Cenk Sahinalp: Layout of the Batcher Bitonic Sorter (Extended Abstract). SPAA 1998 : 172-181 Süleyman Cenk Sahinalp, Uzi Vishkin : Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract). FOCS 1996 : 320-328 Süleyman Cenk Sahinalp, Uzi Vishkin : On a Parallel-Algorithms Method for String Matching Problems. CIAC 1994 : 22-32 Süleyman Cenk Sahinalp, Uzi Vishkin : Symmetry breaking for suffix tree construction. STOC 1994 : 300-309 1 [ 23 ] 2 [ 14 ] 3 [ 13 ] [ 19 ] 4 [ 23 ] 5 [ 17 ] [ 18 ] [ 20 ] [ 23 ] [ 25 ] [ 26 ] 6 [ 4 ] 7 [ 23 ] 8 [ 10 ] 9 [ 9 ] [ 15 ] 10 [ 9 ] [ 10 ] [ 15 ] [ 23 ] 11 [ 24 ] 12 [ 5 ] [ 6 ] [ 8 ] [ 11 ] [ 14 ] [ 16 ] 13 [ 18 ] 14 [ 4 ] [ 5 ] [ 7 ] [ 12 ] [ 14 ] [ 19 ] [ 21 ] [ 22 ] [ 25 ] [ 26 ] 15 [ 24 ] 16 [ 4 ] [ 7 ] [ 9 ] [ 13 ] [ 15 ] 17 [ 9 ] [ 10 ] [ 15 ] 18 [ 6 ] [ 11 ] [ 16 ] 19 [ 17 ] [ 18 ] [ 20 ] 20 [ 17 ] [ 18 ] [ 20 ] 21 [ 7 ] 22 [ 9 ] [ 10 ] [ 15 ] 23 [ 24 ] 24 [ 10 ] 25 [ 1 ] [ 2 ] [ 3 ] [ 13 ] 26 [ 5 ] [ 14 ]  ©2004 Association for Computing Machinery |
