| 2012 | MFCS | In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. | Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen |
| 2006 | COCOON | Computing Maximum-Scoring Segments in Almost Linear Time. | Fredrik Bengtsson, Jingsen Chen |
| 2004 | DaWaK | Space-Efficient Range-Sum Queries in OLAP. | Fredrik Bengtsson, Jingsen Chen |
| 2004 | ISAAC | Efficient Algorithms for k Maximum Sums. | Fredrik Bengtsson, Jingsen Chen |
| 1995 | COCOON | Searching Rigid Data Structures (Extended Abstract). | Svante Carlsson, Jingsen Chen |
| 1995 | ISAAC | Heap Construction: Optimal in Both Worst and Average Cases? | Svante Carlsson, Jingsen Chen |
| 1994 | ESA | Some Lower Bounds for Comparison-Based Algorithms. | Svante Carlsson, Jingsen Chen |
| 1994 | ISAAC | Heaps with Bits. | Svante Carlsson, Jingsen Chen, Christer Mattsson |
| 1994 | ISAAC | Average Cost to Produce Partial Orders. | Jingsen Chen |
| 1993 | ISAAC | A Framework for Constructing Heap-Like Structures In-Place. | Jingsen Chen |
| 1992 | LATIN | Parallel Complexity of Heaps and Min-Max Heaps. | Svante Carlsson, Jingsen Chen |
| 1992 | SODA | The Complexity of Heaps. | Svante Carlsson, Jingsen Chen |
| 1991 | SODA | On Partitions and Presortedness of Sequences. | Jingsen Chen, Svante Carlsson |