![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 52 matches
- 2022
- Monika Henzinger, Alexander Noe, Christian Schulz:
Practical Fully Dynamic Minimum Cut Algorithms. ALENEX 2022: 13-26 - Hugo Lefeuvre
, Vlad-Andrei Badoiu
, Alexander Jung
, Stefan Lucian Teodorescu, Sebastian Rauch, Felipe Huici, Costin Raiciu, Pierre Olivier:
FlexOS: towards flexible OS isolation. ASPLOS 2022: 467-482 - Max Aehle, Johan Alme, Gergely Gábor Barnaföldi, Johannes Blühdorn, Tea Bodova, Vyacheslav Borshchov, Anthony van den Brink, Mamdouh Chaar, Viljar Eikeland, Gregory Feofilov, Christoph Garth, Nicolas R. Gauger, Georgi Genov, Ola Grøttvik, Håvard Helstrup, Sergey Igolkin, Ralf Keidel, Chinorat Kobdaj, Tobias Kortus, Viktor Leonhardt, Shruti Mehendale, Raju Ningappa Mulawade, Odd Harald Odland, George O'Neill, Gábor Papp, Thomas Peitzmann, Helge Egil Seime Pettersen
, Pierluigi Piersimoni, Rohit Pochampalli, Maksym Protsenko, Max Rauch, Attiq Ur Rehman, Matthias Richter, Dieter Röhrich, Max Sagebaum, Joshua Santana, Alexander Schilling, Joao Seco, Arnon Songmoolnak, Jarle Rambo Sølie, Ganesh Tambave, Ihor Tymchuk, Kjetil Ullaland, Monika Varga-Kofarago, Lennart Volz, Boris Wagner, Steffen Wendzel, Alexander Wiebel, RenZheng Xiao, Shiming Yang, Hiroki Yokoyama, Sebastian Zillien:
Derivatives in Proton CT. CoRR abs/2202.05551 (2022) - 2021
- Krishnendu Chatterjee
, Wolfgang Dvorák, Monika Henzinger
, Alexander Svozil:
Algorithms and conditional lower bounds for planning problems. Artif. Intell. 297: 103499 (2021) - Carol Alexander
, Johannes Rauch:
A general property for time aggregation. Eur. J. Oper. Res. 291(2): 536-548 (2021) - Monika Henzinger
, Alexander Noe, Christian Schulz:
Faster Parallel Multiterminal Cuts. ACDA 2021: 100-110 - Gramoz Goranci, Monika Henzinger
, Dariusz Leniowski, Christian Schulz, Alexander Svozil:
Fully Dynamic k-Center Clustering in Low Dimensional Metrics. ALENEX 2021: 143-153 - Krishnendu Chatterjee, Monika Henzinger
, Sagar Kale
, Alexander Svozil:
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. ICALP 2021: 124:1-124:21 - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger
, Alexander Svozil:
Symbolic Time and Space Tradeoffs for Probabilistic Verification. LICS 2021: 1-13 - Monika Henzinger, Alexander Noe, Christian Schulz:
Practical Fully Dynamic Minimum Cut Algorithms. CoRR abs/2101.05033 (2021) - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Symbolic Time and Space Tradeoffs for Probabilistic Verification. CoRR abs/2104.07466 (2021) - Monika Henzinger, Alexander Noe:
Random Rank-Based, Hierarchical or Trivial: Which Dynamic Graph Algorithm Performs Best in Practice? CoRR abs/2108.04564 (2021) - Hugo Lefeuvre, Vlad-Andrei Badoiu, Alexander Jung, Stefan Teodorescu, Sebastian Rauch, Felipe Huici, Costin Raiciu, Pierre Olivier:
FlexOS: Towards Flexible OS Isolation. CoRR abs/2112.06566 (2021) - 2020
- Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. ALENEX 2020: 42-55 - Monika Henzinger
, Alexander Noe
, Christian Schulz
, Darren Strash
:
Finding All Global Minimum Cuts in Practice. ESA 2020: 59:1-59:20 - Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Finding All Global Minimum Cuts In Practice. CoRR abs/2002.06948 (2020) - Monika Henzinger, Alexander Noe, Christian Schulz:
Faster Parallel Multiterminal Cuts. CoRR abs/2004.11666 (2020) - 2019
- Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger
, Alexander Svozil:
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. CONCUR 2019: 7:1-7:16 - Monika Henzinger
, Alexander Noe, Christian Schulz
:
Shared-Memory Exact Minimum Cuts. IPDPS 2019: 13-22 - Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Alexander Svozil:
Fully Dynamic k-Center Clustering in Doubling Metrics. CoRR abs/1908.03948 (2019) - Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. CoRR abs/1908.04141 (2019) - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. CoRR abs/1909.04983 (2019) - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. CoRR abs/1909.05539 (2019) - 2018
- Monika Henzinger
, Alexander Noe
, Christian Schulz
, Darren Strash
:
Practical Minimum Cut Algorithms. ACM J. Exp. Algorithmics 23 (2018) - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Algorithms and Conditional Lower Bounds for Planning Problems. ICAPS 2018: 56-64 - Monika Henzinger, Alexander Noe, Christian Schulz
, Darren Strash
:
Practical Minimum Cut Algorithms. ALENEX 2018: 48-61 - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger
, Alexander Svozil:
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. LPAR 2018: 233-253 - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Algorithms and Conditional Lower Bounds for Planning Problems. CoRR abs/1804.07031 (2018) - Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-memory Exact Minimum Cuts. CoRR abs/1808.05458 (2018) - 2017
- Timo Hanke, Alexander Schaermann, Matthias Geiger, Konstantin Weiler, Nils Hirsenkorn, Andreas Rauch, Stefan-Alexander Schneider, Erwin M. Biebl:
Generation and validation of virtual point cloud data for automated driving systems. ITSC 2017: 1-6
skipping 22 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-08-28 17:20 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint