Jingsen Chen

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Searching rigid data structures Lecture Notes in Computer Science	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 Mathematical Foundations of Computer Science 2012	2012-09-25	Paper
Computing Maximum-Scoring Segments in Almost Linear Time Lecture Notes in Computer Science	2007-09-10	Paper
Ranking \(k\) maximum sums Theoretical Computer Science	2007-06-06	Paper
Efficient algorithms for \(k\) maximum sums Algorithmica	2006-10-16	Paper
Algorithms and Computation Lecture Notes in Computer Science	2005-12-22	Paper
scientific article; zbMATH DE number 1555945 (Why is no real title available?)	2001-01-24	Paper
scientific article; zbMATH DE number 1555930 (Why is no real title available?)	2001-01-24	Paper
Heaps with bits Theoretical Computer Science	1997-02-27	Paper
Computing and ranking measures of presortedness International Journal of Computer Mathematics	1995-11-06	Paper
scientific article; zbMATH DE number 742986 (Why is no real title available?)	1995-04-11	Paper
scientific article; zbMATH DE number 432806 (Why is no real title available?)	1993-10-20	Paper
An optimal parallel adaptive sorting algorithm Information Processing Letters	1992-06-27	Paper
On partitions and presortedness of sequences Acta Informatica	1992-01-01	Paper
A note on the construction of the data structure ``deap'' Information Processing Letters	1989-01-01	Paper

Research outcomes over time

This page was built for person: Jingsen Chen