| 2007 |
|---|
| 24 | EE | Fredrik Bengtsson,
Jingsen Chen:
Ranking k maximum sums.
Theor. Comput. Sci. 377(1-3): 229-237 (2007) |
| 2006 |
|---|
| 23 | EE | Fredrik Bengtsson,
Jingsen Chen:
Computing Maximum-Scoring Segments in Almost Linear Time.
COCOON 2006: 255-264 |
| 22 | EE | Fredrik Bengtsson,
Jingsen Chen:
Efficient Algorithms for k Maximum Sums.
Algorithmica 46(1): 27-41 (2006) |
| 2004 |
|---|
| 21 | EE | Fredrik Bengtsson,
Jingsen Chen:
Space-Efficient Range-Sum Queries in OLAP.
DaWaK 2004: 87-96 |
| 20 | EE | Fredrik Bengtsson,
Jingsen Chen:
Efficient Algorithms for k Maximum Sums.
ISAAC 2004: 137-148 |
| 1996 |
|---|
| 19 | EE | Svante Carlsson,
Jingsen Chen,
Christer Mattsson:
Heaps with Bits.
Theor. Comput. Sci. 164(1&2): 1-12 (1996) |
| 1995 |
|---|
| 18 | | Svante Carlsson,
Jingsen Chen:
Searching Rigid Data Structures (Extended Abstract).
COCOON 1995: 446-451 |
| 17 | | Svante Carlsson,
Jingsen Chen:
Heap Construction: Optimal in Both Worst and Average Cases?
ISAAC 1995: 254-263 |
| 16 | | Jingsen Chen:
An Efficient Construction Algorithm for a Class of Implicit Double-Ended Priority Queues.
Comput. J. 38(10): 818-821 (1995) |
| 1994 |
|---|
| 15 | | Jingsen Chen:
Parallel Heap Construction Using Multiple Selection.
CONPAR 1994: 371-380 |
| 14 | | Svante Carlsson,
Jingsen Chen:
Some Lower Bounds for Comparison-Based Algorithms.
ESA 1994: 106-117 |
| 13 | | Jingsen Chen:
Average Cost to Produce Partial Orders.
ISAAC 1994: 155-163 |
| 12 | | Svante Carlsson,
Jingsen Chen,
Christer Mattsson:
Heaps with Bits.
ISAAC 1994: 288-296 |
| 1993 |
|---|
| 11 | | Jingsen Chen:
A Framework for Constructing Heap-Like Structures In-Place.
ISAAC 1993: 118-127 |
| 1992 |
|---|
| 10 | | Jingsen Chen,
Christos Levcopoulos:
Improved Parallel Sorting of Presorted Sequences.
CONPAR 1992: 539-544 |
| 9 | | Jingsen Chen:
Constructing Priority Queues and Deques Optimally in Parallel.
IFIP Congress (1) 1992: 275-283 |
| 8 | | Jingsen Chen:
Merging and Splitting Priority Queues and Deques in Parallel.
ISTCS 1992: 1-11 |
| 7 | | Svante Carlsson,
Jingsen Chen:
Parallel Complexity of Heaps and Min-Max Heaps.
LATIN 1992: 108-116 |
| 6 | EE | Svante Carlsson,
Jingsen Chen:
The Complexity of Heaps.
SODA 1992: 393-402 |
| 5 | | Svante Carlsson,
Jingsen Chen:
On Partitions and Presortedness of Sequences.
Acta Inf. 29(3): 267-280 (1992) |
| 4 | | Svante Carlsson,
Jingsen Chen:
Parallel Constructions of Heaps and Min-Max Heaps.
Parallel Processing Letters 2: 311-320 (1992) |
| 1991 |
|---|
| 3 | | Jingsen Chen,
Svante Carlsson:
On Partitions and Presortedness of Sequences.
SODA 1991: 62-71 |
| 2 | | Svante Carlsson,
Jingsen Chen:
An Optimal Parallel Adaptive Sorting Algorithm.
Inf. Process. Lett. 39(4): 195-200 (1991) |
| 1989 |
|---|
| 1 | | Svante Carlsson,
Jingsen Chen,
Thomas Strothotte:
A Note on the Construction of Data Structure ``DEAP''.
Inf. Process. Lett. 31(6): 315-317 (1989) |
