SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Jingsen Chen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Svante Carlsson, Jingsen Chen
Searching Rigid Data Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP]
COCOON, 1995, pp:446-451 [Conf]
Fredrik Bengtsson, Jingsen Chen
Computing Maximum-Scoring Segments in Almost Linear Time. [Citation Graph (0, 0)][DBLP]
COCOON, 2006, pp:255-264 [Conf]
Jingsen Chen, Christos Levcopoulos
Improved Parallel Sorting of Presorted Sequences. [Citation Graph (0, 0)][DBLP]
CONPAR, 1992, pp:539-544 [Conf]
Jingsen Chen
Parallel Heap Construction Using Multiple Selection. [Citation Graph (0, 0)][DBLP]
CONPAR, 1994, pp:371-380 [Conf]
Fredrik Bengtsson, Jingsen Chen
Space-Efficient Range-Sum Queries in OLAP. [Citation Graph (0, 0)][DBLP]
DaWaK, 2004, pp:87-96 [Conf]
Svante Carlsson, Jingsen Chen
Some Lower Bounds for Comparison-Based Algorithms. [Citation Graph (0, 0)][DBLP]
ESA, 1994, pp:106-117 [Conf]
Jingsen Chen
Constructing Priority Queues and Deques Optimally in Parallel. [Citation Graph (0, 0)][DBLP]
IFIP Congress (1), 1992, pp:275-283 [Conf]
Fredrik Bengtsson, Jingsen Chen
Efficient Algorithms for k Maximum Sums. [Citation Graph (0, 0)][DBLP]
ISAAC, 2004, pp:137-148 [Conf]
Svante Carlsson, Jingsen Chen
Heap Construction: Optimal in Both Worst and Average Cases? [Citation Graph (0, 0)][DBLP]
ISAAC, 1995, pp:254-263 [Conf]
Svante Carlsson, Jingsen Chen, Christer Mattsson
Heaps with Bits. [Citation Graph (0, 0)][DBLP]
ISAAC, 1994, pp:288-296 [Conf]
Jingsen Chen
A Framework for Constructing Heap-Like Structures In-Place. [Citation Graph (0, 0)][DBLP]
ISAAC, 1993, pp:118-127 [Conf]
Jingsen Chen
Average Cost to Produce Partial Orders. [Citation Graph (0, 0)][DBLP]
ISAAC, 1994, pp:155-163 [Conf]
Jingsen Chen
Merging and Splitting Priority Queues and Deques in Parallel. [Citation Graph (0, 0)][DBLP]
ISTCS, 1992, pp:1-11 [Conf]
Svante Carlsson, Jingsen Chen
Parallel Complexity of Heaps and Min-Max Heaps. [Citation Graph (0, 0)][DBLP]
LATIN, 1992, pp:108-116 [Conf]
Svante Carlsson, Jingsen Chen
The Complexity of Heaps. [Citation Graph (0, 0)][DBLP]
SODA, 1992, pp:393-402 [Conf]
Jingsen Chen, Svante Carlsson
On Partitions and Presortedness of Sequences. [Citation Graph (0, 0)][DBLP]
SODA, 1991, pp:62-71 [Conf]
Svante Carlsson, Jingsen Chen
On Partitions and Presortedness of Sequences. [Citation Graph (0, 0)][DBLP]
Acta Inf., 1992, v:29, n:3, pp:267-280 [Journal]
Fredrik Bengtsson, Jingsen Chen
Efficient Algorithms for k Maximum Sums. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2006, v:46, n:1, pp:27-41 [Journal]
Jingsen Chen
An Efficient Construction Algorithm for a Class of Implicit Double-Ended Priority Queues. [Citation Graph (0, 0)][DBLP]
Comput. J., 1995, v:38, n:10, pp:818-821 [Journal]
Svante Carlsson, Jingsen Chen
An Optimal Parallel Adaptive Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1991, v:39, n:4, pp:195-200 [Journal]
Svante Carlsson, Jingsen Chen, Thomas Strothotte
A Note on the Construction of Data Structure ``DEAP''. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1989, v:31, n:6, pp:315-317 [Journal]
Svante Carlsson, Jingsen Chen
Parallel Constructions of Heaps and Min-Max Heaps. [Citation Graph (0, 0)][DBLP]
Parallel Processing Letters, 1992, v:2, n:, pp:311-320 [Journal]
Svante Carlsson, Jingsen Chen, Christer Mattsson
Heaps with Bits. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1996, v:164, n:1&2, pp:1-12 [Journal]
Fredrik Bengtsson, Jingsen Chen
Ranking k maximum sums. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2007, v:377, n:1-3, pp:229-237 [Journal]

Search in 0.002secs, Finished in 0.003secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP