Jingsen Chen

According to our database, Jingsen Chen authored at least 22 papers between 1989 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2012

In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses.

Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2007

Ranking k maximum sums.

Fredrik Bengtsson, Jingsen Chen

Theor. Comput. Sci., 2007

2006

Efficient Algorithms for k Maximum Sums.

Fredrik Bengtsson, Jingsen Chen

Algorithmica, 2006

Computing Maximum-Scoring Segments in Almost Linear Time.

Fredrik Bengtsson, Jingsen Chen

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2004

Space-Efficient Range-Sum Queries in OLAP.

Fredrik Bengtsson, Jingsen Chen

Proceedings of the Data Warehousing and Knowledge Discovery, 6th International Conference, 2004

1996

Heaps with Bits.

Svante Carlsson, Jingsen Chen, Christer Mattsson

Theor. Comput. Sci., 1996

1995

An Efficient Construction Algorithm for a Class of Implicit Double-Ended Priority Queues.

Jingsen Chen

Comput. J., 1995

Heap Construction: Optimal in Both Worst and Average Cases?

Svante Carlsson, Jingsen Chen

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Searching Rigid Data Structures (Extended Abstract).

Svante Carlsson, Jingsen Chen

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Average Cost to Produce Partial Orders.

Jingsen Chen

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Some Lower Bounds for Comparison-Based Algorithms.

Svante Carlsson, Jingsen Chen

Proceedings of the Algorithms, 1994

Parallel Heap Construction Using Multiple Selection.

Jingsen Chen

Proceedings of the Parallel Processing: CONPAR 94, 1994

1993

A Framework for Constructing Heap-Like Structures In-Place.

Jingsen Chen

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992

Parallel Constructions of Heaps and Min-Max Heaps.

Svante Carlsson, Jingsen Chen

Parallel Process. Lett., 1992

On Partitions and Presortedness of Sequences.

Svante Carlsson, Jingsen Chen

Acta Informatica, 1992

The Complexity of Heaps.

Svante Carlsson, Jingsen Chen

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Parallel Complexity of Heaps and Min-Max Heaps.

Svante Carlsson, Jingsen Chen

Proceedings of the LATIN '92, 1992

Merging and Splitting Priority Queues and Deques in Parallel.

Jingsen Chen

Proceedings of the Theory of Computing and Systems, 1992

Constructing Priority Queues and Deques Optimally in Parallel.

Jingsen Chen

Proceedings of the Algorithms, Software, Architecture, 1992

Improved Parallel Sorting of Presorted Sequences.

Jingsen Chen, Christos Levcopoulos

Proceedings of the Parallel Processing: CONPAR 92, 1992

1991

An Optimal Parallel Adaptive Sorting Algorithm.

Svante Carlsson, Jingsen Chen

Inf. Process. Lett., 1991

1989

A Note on the Construction of Data Structure "DEAP".

Svante Carlsson, Jingsen Chen, Thomas Strothotte

Inf. Process. Lett., 1989