Jingsen Chen

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from VLDB 2026 / reviewers in the wild / expert

dblp:79/450 · DBLP profile ↗

← Back

20ranked-venue papers

5as first author

0since 2021 · last 2012

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 18 · 4 first-authorDatabases, data management, data science and information retrieval · 3Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

2 papers

Algorithms and data structures · 54% Coding theory · 23% Computational geometry · 23%

Topics — the 4 heaviest of 4, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Algorithms and data structures › analysis of algorithms data structure complexity	1	1992	The Complexity of Heaps · SODA 1992
Algorithms and data structures › priority queues heap	1	1992	The Complexity of Heaps · SODA 1992
Computational geometry partitioning	1	1991	On Partitions and Presortedness of Sequences · SODA 1991
Coding theory sequences	1	1991	On Partitions and Presortedness of Sequences · SODA 1991

Methods — techniques the papers use, named apart from their topics

complexity analysis · 0.0

Year	Publication	Venue	Position
2012	In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen	MFCS	1
2007	Ranking k maximum sums Fredrik Bengtsson, Jingsen Chen	Theor. Comput. Sci.	2
2006	Computing Maximum-Scoring Segments in Almost Linear Time Fredrik Bengtsson, Jingsen Chen	COCOON	2
2006	Efficient Algorithms for k Maximum Sums Fredrik Bengtsson, Jingsen Chen	Algorithmica	2
2004	Space-Efficient Range-Sum Queries in OLAP Fredrik Bengtsson, Jingsen Chen	DaWaK	2
2004	Efficient Algorithms for k Maximum Sums Fredrik Bengtsson, Jingsen Chen	ISAAC	2
1996	Heaps with Bits Svante Carlsson, Jingsen Chen, Christer Mattsson	Theor. Comput. Sci.	2
1995	Searching Rigid Data Structures (Extended Abstract) Svante Carlsson, Jingsen Chen	COCOON	2
1995	Heap Construction: Optimal in Both Worst and Average Cases? Svante Carlsson, Jingsen Chen	ISAAC	2
1995	An Efficient Construction Algorithm for a Class of Implicit Double-Ended Priority Queues abstract Priority queues and double-ended priority queues are fundamental data types in Computer Science, and various data structures have been proposed to implement them. In particular, diamond deques, interval heaps, min-max-pair heaps, and twin-heaps provide implicit structures for double-ended priority queues. Although these heap-like structures are essentially the same when they are presented in an abstract manner, they possess different implementations and thus have different construction algorithms. In this paper, we present a fast algorithm for building these data structures. Our results improve over previously fast known algorithms. Jingsen Chen	Comput. J.	1
1994	Some Lower Bounds for Comparison-Based Algorithms Svante Carlsson, Jingsen Chen	ESA	2
1994	Heaps with Bits Svante Carlsson, Jingsen Chen, Christer Mattsson	ISAAC	2
1994	Average Cost to Produce Partial Orders Jingsen Chen	ISAAC	1
1993	A Framework for Constructing Heap-Like Structures In-Place Jingsen Chen	ISAAC	1
1992	Parallel Complexity of Heaps and Min-Max Heaps Svante Carlsson, Jingsen Chen	LATIN	2
1992	The Complexity of Heaps Svante Carlsson, Jingsen Chen	SODA	2
1992	On Partitions and Presortedness of Sequences Svante Carlsson, Jingsen Chen	Acta Informatica	2
1991	On Partitions and Presortedness of Sequences Jingsen Chen, Svante Carlsson	SODA	1
1991	An Optimal Parallel Adaptive Sorting Algorithm Svante Carlsson, Jingsen Chen	Inf. Process. Lett.	2
1989	A Note on the Construction of Data Structure "DEAP" Svante Carlsson, Jingsen Chen, Thomas Strothotte	Inf. Process. Lett.	2