default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMihail Stoian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j3]Alexander van Renen, Mihail Stoian, Andreas Kipf:
DataLoom: Simplifying Data Loading with LLMs. Proc. VLDB Endow. 17(12): 4449-4452 (2024)- [j2]Mihail Stoian
, Richard M. Milbradt, Christian B. Mendl:
On the Optimal Linear Contraction Order of Tree Tensor Networks, and Beyond. SIAM J. Sci. Comput. 46(5): 647- (2024) - 2020
- [j1]Ryan Marcus, Andreas Kipf, Alexander van Renen, Mihail Stoian, Sanchit Misra, Alfons Kemper, Thomas Neumann, Tim Kraska:
Benchmarking Learned Indexes. Proc. VLDB Endow. 14(1): 1-13 (2020)
Conference and Workshop Papers
- 2024
- [c5]Hanwen Liu, Mihail Stoian, Alexander van Renen, Andreas Kipf:
Corra: Correlation-Aware Column Compression. VLDB Workshops 2024 - 2023
- [c4]Mihail Stoian:
Faster FFT-based Wildcard Pattern Matching. SIGMOD Conference Companion 2023: 277-279 - [c3]Mihail Stoian:
Fast Joint Shapley Values. SIGMOD Conference Companion 2023: 285-287 - 2022
- [c2]Mihail Stoian:
Concurrent Link-Cut Trees. SIGMOD Conference 2022: 2503-2505 - 2020
- [c1]Andreas Kipf, Ryan Marcus, Alexander van Renen, Mihail Stoian, Alfons Kemper, Tim Kraska, Thomas Neumann:
RadixSpline: a single-pass learned index. aiDM@SIGMOD 2020: 5:1-5:5
Informal and Other Publications
- 2024
- [i12]Jan Schuchardt, Mihail Stoian, Arthur Kosmala, Stephan Günnemann:
Group Privacy Amplification and Unified Amplification by Subsampling for Rényi Differential Privacy. CoRR abs/2403.04867 (2024) - [i11]Hanwen Liu, Mihail Stoian, Alexander van Renen, Andreas Kipf:
Corra: Correlation-Aware Column Compression. CoRR abs/2403.17229 (2024) - [i10]Mihail Stoian:
Sinking an Algorithmic Isthmus: (1 + {\epsilon})-Approximate Min-Sum Subset Convolution. CoRR abs/2404.11364 (2024) - [i9]Mihail Stoian:
Did Fourier Really Meet Möbius? Fast Subset Convolution via FFT. CoRR abs/2404.18522 (2024) - [i8]Mihail Stoian:
TSP Escapes the O(2n n2) Curse. CoRR abs/2405.03018 (2024) - [i7]Mihail Stoian, Andreas Kipf:
DPconv: Super-Polynomially Faster Join Ordering. CoRR abs/2409.08013 (2024) - [i6]Mihail Stoian, Alexander van Renen, Jan Kobiolka, Ping-Lin Kuo, Josif Grabocka, Andreas Kipf:
Lightweight Correlation-Aware Table Compression. CoRR abs/2410.14066 (2024) - 2022
- [i5]Mihail Stoian:
On the Optimal Linear Contraction Order for Tree Tensor Networks. CoRR abs/2209.12332 (2022) - 2021
- [i4]Mihail Stoian, Andreas Kipf, Ryan Marcus, Tim Kraska:
PLEX: Towards Practical Learned Indexing. CoRR abs/2108.05117 (2021) - 2020
- [i3]Andreas Kipf, Ryan Marcus, Alexander van Renen, Mihail Stoian, Alfons Kemper, Tim Kraska, Thomas Neumann:
RadixSpline: A Single-Pass Learned Index. CoRR abs/2004.14541 (2020) - [i2]Ryan Marcus, Andreas Kipf, Alexander van Renen, Mihail Stoian, Sanchit Misra, Alfons Kemper, Thomas Neumann, Tim Kraska:
Benchmarking Learned Indexes. CoRR abs/2006.12804 (2020) - 2019
- [i1]Andreas Kipf, Ryan Marcus, Alexander van Renen, Mihail Stoian, Alfons Kemper, Tim Kraska, Thomas Neumann:
SOSD: A Benchmark for Learned Indexes. CoRR abs/1911.13014 (2019)
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-11-26 21:40 CET 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:
