default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMorten Stöckel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j5]Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing light spanners deterministically in near-linear time. Theor. Comput. Sci. 907: 82-112 (2022)- 2020
- [j4]Mikkel Abrahamsen
, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-optimal induced universal graphs for cycles and paths. Discret. Appl. Math. 282: 1-13 (2020)
2010 – 2019
- 2019
- [c10]Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing Light Spanners Deterministically in Near-Linear Time. ESA 2019: 4:1-4:15 - 2018
- [j3]Morten Stöckel:
Randomized Primitives for Big Data Processing. Künstliche Intell. 32(1): 91-94 (2018) - 2017
- [j2]Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel:
I/O-Efficient Similarity Join. Algorithmica 78(4): 1263-1283 (2017) - [c9]Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. ICALP 2017: 128:1-128:14 - [c8]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Finding even cycles faster via capped k-walks. STOC 2017: 112-120 - [i9]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Finding Even Cycles Faster via Capped k-Walks. CoRR abs/1703.10380 (2017) - [i8]Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel:
New Subquadratic Approximation Algorithms for the Girth. CoRR abs/1704.02178 (2017) - [i7]Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing Light Spanners Deterministically in Near-Linear Time. CoRR abs/1709.01960 (2017) - 2016
- [c7]Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg, Morten Stöckel:
Graph Reconstruction with a Betweenness Oracle. STACS 2016: 5:1-5:14 - [i6]Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. CoRR abs/1607.04911 (2016) - 2015
- [c6]Riko Jacob, Morten Stöckel:
Fast Output-Sensitive Matrix Multiplication. ESA 2015: 766-778 - [c5]Mathias Bæk Tejs Knudsen, Morten Stöckel:
Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence. ESA 2015: 828-839 - [c4]Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel:
I/O-Efficient Similarity Join. ESA 2015: 941-952 - [i5]Rasmus Pagh, Morten Stöckel:
Association Rule Mining using Maximum Entropy. CoRR abs/1501.02143 (2015) - [i4]Mathias Bæk Tejs Knudsen, Morten Stöckel:
Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence. CoRR abs/1502.05729 (2015) - [i3]Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel:
I/O-Efficient Similarity Join. CoRR abs/1507.00552 (2015) - 2014
- [c3]Rasmus Pagh, Morten Stöckel:
The Input/Output Complexity of Sparse Matrix Multiplication. ESA 2014: 750-761 - [c2]Rasmus Pagh, Morten Stöckel, David P. Woodruff:
Is min-wise hashing optimal for summarizing set intersection? PODS 2014: 109-120 - [i2]Rasmus Pagh, Morten Stöckel:
The Input/Output Complexity of Sparse Matrix Multiplication. CoRR abs/1403.3551 (2014) - 2013
- [j1]Søren Bøg, Morten Stöckel, Hjalte Wedel Vildhøj:
The hardness of the functional orientation 2-color problem. Australas. J Comb. 56: 225-234 (2013) - 2012
- [c1]Philip Bille, Morten Stöckel:
Fast and Cache-Oblivious Dynamic Programming with Local Dependencies. LATA 2012: 131-142 - [i1]Søren Bøg, Morten Stöckel, Hjalte Wedel Vildhøj:
The Hardness of the Functional Orientation 2-Color Problem. CoRR abs/1210.2544 (2012)
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-05-02 20:58 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:
