default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJingsen Chen
Person information
- affiliation: Luleå University of Technology, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c17]Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. MFCS 2012: 259-270
2000 – 2009
- 2007
- [j8]Fredrik Bengtsson, Jingsen Chen:
Ranking k maximum sums. Theor. Comput. Sci. 377(1-3): 229-237 (2007) - 2006
- [j7]Fredrik Bengtsson, Jingsen Chen:
Efficient Algorithms for k Maximum Sums. Algorithmica 46(1): 27-41 (2006) - [c16]Fredrik Bengtsson, Jingsen Chen:
Computing Maximum-Scoring Segments in Almost Linear Time. COCOON 2006: 255-264 - 2004
- [c15]Fredrik Bengtsson, Jingsen Chen:
Space-Efficient Range-Sum Queries in OLAP. DaWaK 2004: 87-96 - [c14]Fredrik Bengtsson, Jingsen Chen:
Efficient Algorithms for k Maximum Sums. ISAAC 2004: 137-148
1990 – 1999
- 1996
- [j6]Svante Carlsson, Jingsen Chen, Christer Mattsson:
Heaps with Bits. Theor. Comput. Sci. 164(1&2): 1-12 (1996) - 1995
- [j5]Jingsen Chen:
An Efficient Construction Algorithm for a Class of Implicit Double-Ended Priority Queues. Comput. J. 38(10): 818-821 (1995) - [c13]Svante Carlsson, Jingsen Chen:
Searching Rigid Data Structures (Extended Abstract). COCOON 1995: 446-451 - [c12]Svante Carlsson, Jingsen Chen:
Heap Construction: Optimal in Both Worst and Average Cases? ISAAC 1995: 254-263 - 1994
- [c11]Jingsen Chen:
Parallel Heap Construction Using Multiple Selection. CONPAR 1994: 371-380 - [c10]Svante Carlsson, Jingsen Chen:
Some Lower Bounds for Comparison-Based Algorithms. ESA 1994: 106-117 - [c9]Jingsen Chen:
Average Cost to Produce Partial Orders. ISAAC 1994: 155-163 - [c8]Svante Carlsson, Jingsen Chen, Christer Mattsson:
Heaps with Bits. ISAAC 1994: 288-296 - 1993
- [c7]Jingsen Chen:
A Framework for Constructing Heap-Like Structures In-Place. ISAAC 1993: 118-127 - 1992
- [j4]Svante Carlsson, Jingsen Chen:
On Partitions and Presortedness of Sequences. Acta Informatica 29(3): 267-280 (1992) - [j3]Svante Carlsson, Jingsen Chen:
Parallel Constructions of Heaps and Min-Max Heaps. Parallel Process. Lett. 2: 311-320 (1992) - [c6]Jingsen Chen, Christos Levcopoulos:
Improved Parallel Sorting of Presorted Sequences. CONPAR 1992: 539-544 - [c5]Jingsen Chen:
Constructing Priority Queues and Deques Optimally in Parallel. IFIP Congress (1) 1992: 275-283 - [c4]Jingsen Chen:
Merging and Splitting Priority Queues and Deques in Parallel. ISTCS 1992: 1-11 - [c3]Svante Carlsson, Jingsen Chen:
Parallel Complexity of Heaps and Min-Max Heaps. LATIN 1992: 108-116 - [c2]Svante Carlsson, Jingsen Chen:
The Complexity of Heaps. SODA 1992: 393-402 - 1991
- [j2]Svante Carlsson, Jingsen Chen:
An Optimal Parallel Adaptive Sorting Algorithm. Inf. Process. Lett. 39(4): 195-200 (1991) - [c1]Jingsen Chen, Svante Carlsson:
On Partitions and Presortedness of Sequences. SODA 1991: 62-71
1980 – 1989
- 1989
- [j1]Svante Carlsson, Jingsen Chen, Thomas Strothotte:
A Note on the Construction of Data Structure "DEAP". Inf. Process. Lett. 31(6): 315-317 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
