Jingsen Chen

According to our database1, Jingsen Chen
  • authored at least 25 papers between 1989 and 2012.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2012
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2007
Ranking k maximum sums.
Theor. Comput. Sci., 2007

2006
Efficient Algorithms for k Maximum Sums.
Algorithmica, 2006

Computing Maximum-Scoring Segments in Almost Linear Time.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2004
Efficient Algorithms for k Maximum Sums.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Space-Efficient Range-Sum Queries in OLAP.
Proceedings of the Data Warehousing and Knowledge Discovery, 6th International Conference, 2004

1996
Heaps with Bits.
Theor. Comput. Sci., 1996

1995
An Efficient Construction Algorithm for a Class of Implicit Double-Ended Priority Queues.
Comput. J., 1995

Heap Construction: Optimal in Both Worst and Average Cases?
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Searching Rigid Data Structures (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Average Cost to Produce Partial Orders.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Heaps with Bits.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Some Lower Bounds for Comparison-Based Algorithms.
Proceedings of the Algorithms, 1994

Parallel Heap Construction Using Multiple Selection.
Proceedings of the Parallel Processing: CONPAR 94, 1994

1993
A Framework for Constructing Heap-Like Structures In-Place.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992
Parallel Constructions of Heaps and Min-Max Heaps.
Parallel Processing Letters, 1992

On Partitions and Presortedness of Sequences.
Acta Inf., 1992

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

Parallel Complexity of Heaps and Min-Max Heaps.
Proceedings of the LATIN '92, 1992

Merging and Splitting Priority Queues and Deques in Parallel.
Proceedings of the Theory of Computing and Systems, 1992

Constructing Priority Queues and Deques Optimally in Parallel.
Proceedings of the Algorithms, Software, Architecture, 1992

Improved Parallel Sorting of Presorted Sequences.
Proceedings of the Parallel Processing: CONPAR 92, 1992

1991
An Optimal Parallel Adaptive Sorting Algorithm.
Inf. Process. Lett., 1991

On Partitions and Presortedness of Sequences.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1989
A Note on the Construction of Data Structure "DEAP".
Inf. Process. Lett., 1989


  Loading...