default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNils Vortmeier
Person information
- affiliation: Ruhr-University Bochum, Germany
- affiliation: TU Dortmund, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Dan Olteanu
, Nils Vortmeier, Dorde Zivanovic:
Givens rotations for QR decomposition, SVD and PCA over database joins. VLDB J. 33(4): 1013-1037 (2024)- [c15]Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume:
Query Maintenance Under Batch Changes with Small-Depth Circuits. MFCS 2024: 46:1-46:16 - [c14]Julien Grange, Fabian Vehlken, Nils Vortmeier, Thomas Zeume:
Specification and Automatic Verification of Computational Reductions. MFCS 2024: 56:1-56:14 - [i13]Julien Grange, Fabian Vehlken, Nils Vortmeier, Thomas Zeume:
Specification and Automatic Verification of Computational Reductions. CoRR abs/2407.04037 (2024) - [i12]Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume:
Query maintenance under batch changes with small-depth circuits. CoRR abs/2407.20031 (2024) - 2023
- [c13]Felix Tschirbs, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Regular Languages: Big Changes, Small Work. CSL 2023: 35:1-35:19 - 2022
- [c12]Dan Olteanu, Nils Vortmeier, Dorde Zivanovic:
Givens QR Decomposition over Relational Databases. SIGMOD Conference 2022: 1948-1961 - [e1]Dan Olteanu, Nils Vortmeier:
25th International Conference on Database Theory, ICDT 2022, March 29 to April 1, 2022, Edinburgh, UK (Virtual Conference). LIPIcs 220, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-223-5 [contents] - [i11]Dan Olteanu, Nils Vortmeier, Dorde Zivanovic:
Givens QR Decomposition over Relational Databases. CoRR abs/2204.00525 (2022) - 2021
- [j4]Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Parity Exists Queries. Log. Methods Comput. Sci. 17(4) (2021) - [c11]Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume:
Work-sensitive Dynamic Complexity of Formal Languages. FoSSaCS 2021: 490-509 - [c10]Nils Vortmeier, Ioannis Kokkinis:
The Dynamic Complexity of Acyclic Hypergraph Homomorphisms. WG 2021: 232-244 - [i10]Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume:
Work-sensitive Dynamic Complexity of Formal Languages. CoRR abs/2101.08735 (2021) - [i9]Nils Vortmeier, Ioannis Kokkinis:
The Dynamic Complexity of Acyclic Hypergraph Homomorphisms. CoRR abs/2107.06121 (2021) - 2020
- [j3]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Sketches of Dynamic Complexity. SIGMOD Rec. 49(2): 18-29 (2020) - [c9]Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis:
Dynamic Complexity Meets Parameterised Algorithms. CSL 2020: 36:1-36:17 - [c8]Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Parity Exists Queries. CSL 2020: 37:1-37:16 - [c7]Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Reachability: How Many Changes Can We Handle? ICALP 2020: 122:1-122:19 - [i8]Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume:
Dynamic complexity of Reachability: How many changes can we handle? CoRR abs/2004.12739 (2020)
2010 – 2019
- 2019
- [b1]Nils Vortmeier:
Dynamic expressibility under complex changes. Technical University of Dortmund, Germany, 2019 - [j2]Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
A Strategy for Dynamic Programs: Start over and Muddle through. Log. Methods Comput. Sci. 15(2) (2019) - [i7]Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Parity Exists Queries. CoRR abs/1910.06004 (2019) - [i6]Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis:
Dynamic Complexity Meets Parameterised Algorithms. CoRR abs/1910.06281 (2019) - 2018
- [j1]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity under Definable Changes. ACM Trans. Database Syst. 43(3): 12:1-12:38 (2018) - [c6]Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume:
Reachability and Distances under Multiple Changes. ICALP 2018: 120:1-120:14 - [i5]Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume:
Reachability and Distances under Multiple Changes. CoRR abs/1804.08555 (2018) - 2017
- [c5]Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
A Strategy for Dynamic Programs: Start over and Muddle Through. ICALP 2017: 98:1-98:14 - [c4]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity under Definable Changes. ICDT 2017: 19:1-19:18 - [i4]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity under Definable Changes. CoRR abs/1701.02494 (2017) - [i3]Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
A Strategy for Dynamic Programs: Start over and Muddle through. CoRR abs/1704.07998 (2017) - 2016
- [c3]Pablo Muñoz, Nils Vortmeier, Thomas Zeume:
Dynamic Graph Queries. ICDT 2016: 14:1-14:18 - 2015
- [c2]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Static Analysis for Logic-based Dynamic Programs. CSL 2015: 308-324 - [i2]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Static Analysis for Logic-Based Dynamic Programs. CoRR abs/1507.04537 (2015) - [i1]Pablo Muñoz, Nils Vortmeier, Thomas Zeume:
Dynamic Graph Queries. CoRR abs/1512.05511 (2015) - 2012
- [c1]Annika Jordan, Dimitri Scheftelowitsch, Jan Lahni, Jannic Hartwecker, Matthias Kuchem, Mirko Walter-Huber, Nils Vortmeier, Tim Delbrügger, Ümit Güler, Igor Vatolkin, Mike Preuss:
BeatTheBeat music-based procedural content generation in a mobile game. CIG 2012: 320-327
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-12-10 21:48 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:
