Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Chen, Jingsen"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
In-place heap construction with optimized comparisons, moves, and cache misses
Jingsen Chen
,
Stefan Edelkamp
,
Amr Elmasry
,
Jyrki Katajainen
Lecture Notes in Computer Science
7464
, 2012, pp. 259-270
Ranking
k
maximum sums
Fredrik Bengtsson
,
Jingsen Chen
Theoretical Computer Science
377
(1-3), 2007, pp. 229-237
Efficient algorithms for
k
maximum sums
Fredrik Bengtsson
,
Jingsen Chen
Algorithmica
46
(1), 2006, pp. 27-41
Computing maximum-scoring segments in almost linear time
Fredrik Bengtsson
,
Jingsen Chen
Lecture Notes in Computer Science
4112
, 2006, pp. 255-264
Efficient algorithms for
k
maximum sums
Fredrik Bengtsson
,
Jingsen Chen
Lecture Notes in Computer Science
3341
, 2004, pp. 137-148
Heaps with bits
Svante Carlsson
,
Jingsen Chen
,
Christer Mattsson
Theoretical Computer Science
164
(1-2), 1996, pp. 1-12
Searching rigid data structures
Svante Carlsson
,
Jingsen Chen
Lecture Notes in Computer Science
959
, 1995, pp. 446-451
Heap construction: Optimal in both worst and average cases?
Svante Carlsson
,
Jingsen Chen
Lecture Notes in Computer Science
1004
, 1995, pp. 254-263
Heaps with bits
Svante Carlsson
,
Jingsen Chen
,
Christer Mattsson
Lecture Notes in Computer Science
834
, 1994, pp. 288-296
Some lower bounds for comparison-based algorithms
Svante Carlsson
,
Jingsen Chen
Proceedings of the 2nd Annual European Symposium on Algorithms. ESA '94 (Utrecht, The Netherlands, September 26-28, 1994)
LNCS 855
, 1994, pp. 106-117
Average cost to produce partial orders
Jingsen Chen
Lecture Notes in Computer Science
834
, 1994, pp. 155-163
Parallel heap construction using multiple selection
Jingsen Chen
Lecture Notes in Computer Science
854
, 1994, pp. 371-380
A framework for constructing heap-like structures in-place
Jingsen Chen
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 118-127
Parallel complexity of heaps and min-max heaps
Svante Carlsson
,
Jingsen Chen
Lecture Notes in Computer Science
583
, 1992, pp. 108-116
The complexity of heaps
Svante Carlsson
,
Jingsen Chen
Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'92 (Orlando, Florida, January 27-29, 1992)
, 1992, pp. 393-402
On partitions and presortedness of sequences
Svante Carlsson
,
Jingsen Chen
Acta Informatica
29
, 1992, pp. 267-280
Parallel constructions of heaps and min-max heaps
Svante Carlsson
,
Jingsen Chen
Parallel Processing Letters
2
(4), 1992, pp. 311-320
Improved parallel sorting of presorted sequences
Jingsen Chen
,
Christos Levcopoulos
Lecture Notes in Computer Science
634
, 1992, pp. 539-544
An optimal parallel adaptive sorting algorithm
Svante Carlsson
,
Jingsen Chen
Information Processing Letters
39
, 1991, pp. 195-200
On partitions and presortedness of sequences
Jingsen Chen
,
Svante Carlsson
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'91 (San Francisco, California, January 28-30, 1991)
, 1991, pp. 62-71
A note on the construction of the data structure ``deap''
Svante Carlsson
,
Jingsen Chen
,
Thomas Strothotte
Information Processing Letters
31
, 1989, pp. 315-317