Jingsen Chen

25 papers A* 2A 1B 8Misc 2Journal 8Unranked 4
YearRankTypeTitle / Venue / Authors
2012 B conf
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses.
MFCS
Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2007 J jnl
Ranking k maximum sums.
Theor. Comput. Sci.
Fredrik Bengtsson, Jingsen Chen
2006 Misc conf
Computing Maximum-Scoring Segments in Almost Linear Time.
COCOON
Fredrik Bengtsson, Jingsen Chen
2006 J jnl
Efficient Algorithms for k Maximum Sums.
Algorithmica
Fredrik Bengtsson, Jingsen Chen
2004 B conf
Efficient Algorithms for k Maximum Sums.
ISAAC
Fredrik Bengtsson, Jingsen Chen
2004 B conf
Space-Efficient Range-Sum Queries in OLAP.
DaWaK
Fredrik Bengtsson, Jingsen Chen
1996 J jnl
Heaps with Bits.
Theor. Comput. Sci.
Svante Carlsson, Jingsen Chen, Christer Mattsson
1995 J jnl
An Efficient Construction Algorithm for a Class of Implicit Double-Ended Priority Queues.
Comput. J.
Jingsen Chen
1995 B conf
Heap Construction: Optimal in Both Worst and Average Cases?
ISAAC
Svante Carlsson, Jingsen Chen
1995 Misc conf
Searching Rigid Data Structures (Extended Abstract).
COCOON
Svante Carlsson, Jingsen Chen
1994 B conf
Average Cost to Produce Partial Orders.
ISAAC
Jingsen Chen
1994 B conf
Heaps with Bits.
ISAAC
Svante Carlsson, Jingsen Chen, Christer Mattsson
1994 — conf
Parallel Heap Construction Using Multiple Selection.
CONPAR
Jingsen Chen
1994 A conf
Some Lower Bounds for Comparison-Based Algorithms.
ESA
Svante Carlsson, Jingsen Chen
1993 B conf
A Framework for Constructing Heap-Like Structures In-Place.
ISAAC
Jingsen Chen
1992 — conf
Constructing Priority Queues and Deques Optimally in Parallel.
IFIP Congress (1)
Jingsen Chen
1992 — conf
Improved Parallel Sorting of Presorted Sequences.
CONPAR
Jingsen Chen, Christos Levcopoulos
1992 — conf
Merging and Splitting Priority Queues and Deques in Parallel.
ISTCS
Jingsen Chen
1992 J jnl
On Partitions and Presortedness of Sequences.
Acta Informatica
Svante Carlsson, Jingsen Chen
1992 B conf
Parallel Complexity of Heaps and Min-Max Heaps.
LATIN
Svante Carlsson, Jingsen Chen
1992 J jnl
Parallel Constructions of Heaps and Min-Max Heaps.
Parallel Process. Lett.
Svante Carlsson, Jingsen Chen
1992 A* conf
The Complexity of Heaps.
SODA
Svante Carlsson, Jingsen Chen
1991 J jnl
An Optimal Parallel Adaptive Sorting Algorithm.
Inf. Process. Lett.
Svante Carlsson, Jingsen Chen
1991 A* conf
On Partitions and Presortedness of Sequences.
SODA
Jingsen Chen, Svante Carlsson
1989 J jnl
A Note on the Construction of Data Structure "DEAP".
Inf. Process. Lett.
Svante Carlsson, Jingsen Chen, Thomas Strothotte