Jingsen Chen

Available identifiers

zbMath Open chen.jingsenMaRDI QIDQ671417

List of research outcomes

Publication	Date of Publication	Type
Searching rigid data structures	2023-12-12	Paper
Heap construction: Optimal in both worst and average cases?	2023-03-21	Paper
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses	2012-09-25	Paper
Computing Maximum-Scoring Segments in Almost Linear Time	2007-09-10	Paper
Ranking \(k\) maximum sums	2007-06-06	Paper
Efficient algorithms for \(k\) maximum sums	2006-10-16	Paper
Algorithms and Computation	2005-12-22	Paper
https://portal.mardi4nfdi.de/entity/Q4525712	2001-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q4525696	2001-01-24	Paper
Heaps with bits	1997-02-27	Paper
Computing and ranking measures of presortedness	1995-11-06	Paper
https://portal.mardi4nfdi.de/entity/Q4763425	1995-04-11	Paper
https://portal.mardi4nfdi.de/entity/Q3138940	1993-10-20	Paper
An optimal parallel adaptive sorting algorithm	1992-06-27	Paper
On partitions and presortedness of sequences	1992-01-01	Paper
A note on the construction of the data structure ``deap	1989-01-01	Paper

Research outcomes over time

This page was built for person: Jingsen Chen