| 2008 | Average-Case Competitive Analyses for One-Way Trading. | Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi |
| 2008 | A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model. | Bin Fu, Zhixiang Chen |
| 2008 | Structural Identifiability in Low-Rank Matrix Factorization. | Epameinondas Fritzilas, Yasmn . Ros-Sols, Sven Rahmann |
| 2008 | Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis. | Anne Condon, Jn Manuch, Chris Thachuk |
| 2008 | Adjacent Swaps on Strings. | Bhadrachalam Chitturi, Ivan Hal Sudborough, Walter Voit, Xuerong Feng |
| 2008 | Quantum Separation of Local Search and Fixed Point Computation. | Xi Chen, Xiaoming Sun, Shang-Hua Teng |
| 2008 | Spreading Messages. | Ching-Lueh Chang, Yuh-Dauh Lyuu |
| 2008 | Probe Ptolemaic Graphs. | David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng |
| 2008 | Isoperimetric Problem and Meta-Fibonacci Sequences. | B. V. Subramanya Bharadwaj, L. Sunil Chandran, Anita Das |
| 2008 | Voronoi Diagram of Polygonal Chains under the Discrete Frchet Distance. | Sergey Bereg, Kevin Buchin, Maike Buchin, Marina L. Gavrilova, Binhai Zhu |
| 2008 | On Some City Guarding Problems. | Lichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon C. Ntafos, Junqiang Zhou |
| 2008 | Efficient Compression of Web Graphs. | Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki |
| 2008 | The Orbit Problem Is in the GapL Hierarchy. | Vikraman Arvind, T. C. Vijayaraghavan |
| 2008 | Counting Polycubes without the Dimensionality Curse. | Gadi Aleksandrowicz, Gill Barequet |
| 2007 | Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals. | Xizhong Zheng |
| 2007 | Streaming Algorithms Measured in Terms of the Computed Quantity. | Shengyu Zhang |
| 2007 | An Improved Algorithm for Online Unit Clustering. | Hamid Zarrabi-Zadeh, Timothy M. Chan |
| 2007 | On the Representations of NC and Log-Space Real Numbers. | Fuxiang Yu |
| 2007 | Priority Algorithms for the Subset-Sum Problem. | Yuli Ye, Allan Borodin |
| 2007 | A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method. | Lei Xin, Bin Ma, Kaizhong Zhang |
| 2007 | A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem. | Yufeng Wu, Dan Gusfield |
| 2007 | Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. | Lusheng Wang, Zhanyong Wang, Zhi-Zhong Chen |
| 2007 | Volume Computation Using a Direct Monte Carlo Method. | Sheng Liu, Jian Zhang, Binhai Zhu |
| 2007 | A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem. | Yunlong Liu, Jianer Chen, Jianxin Wang |
| 2007 | Information Distance from a Question to an Answer. | Ming Li |