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
no 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 54 matches
- 2024
- Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa:
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. CoRR abs/2405.13613 (2024) - 2023
- Dennis Wong, Fabio Calero, Kushal Sedhai:
Generating 2-Gray codes for ballot sequences in constant amortized time. Discret. Math. 346(1): 113168 (2023) - Yuhang Bai, Zhiwei Guo, Shenggui Zhang, Yandong Bai:
Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs. J. Comb. Optim. 45(2): 73 (2023) - Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup:
Fully Dynamic Connectivity in O(log n(loglog n)2) Amortized Expected Time. TheoretiCS 2 (2023) - 2022
- Kazuhiro Kurita, Kunihiro Wasa:
Constant amortized time enumeration of Eulerian trails. Theor. Comput. Sci. 923: 1-12 (2022) - Sindy Löwe, David Madras, Richard S. Zemel, Max Welling:
Amortized Causal Discovery: Learning to Infer Causal Graphs from Time-Series Data. CLeaR 2022: 509-525 - Henry Corrigan-Gibbs, Alexandra Henzinger, Dmitry Kogan:
Single-Server Private Information Retrieval with Sublinear Amortized Time. EUROCRYPT (2) 2022: 3-33 - Corwin Sinnamon, Robert E. Tarjan:
A Simpler Proof that Pairing Heaps Take O(1) Amortized Time per Insertion. CoRR abs/2208.11791 (2022) - Henry Corrigan-Gibbs, Alexandra Henzinger, Dmitry Kogan:
Single-Server Private Information Retrieval with Sublinear Amortized Time. IACR Cryptol. ePrint Arch. 2022: 81 (2022) - Arthur Lazzaretti, Charalampos Papamanthou:
Single Server PIR with Sublinear Amortized Time and Polylogarithmic Bandwidth. IACR Cryptol. ePrint Arch. 2022: 830 (2022) - 2021
- Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura:
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. Theor. Comput. Sci. 874: 32-41 (2021) - Victor Parque, Tomoyuki Miyashita:
An Efficient Scheme for the Generation of Ordered Trees in Constant Amortized Time. IMCOM 2021: 1-8 - Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. SODA 2021: 2537-2549 - Kazuhiro Kurita, Kunihiro Wasa:
Constant Amortized Time Enumeration of Eulerian trails. CoRR abs/2101.10473 (2021) - Keming Zhang, Joshua S. Bloom, B. Scott Gaudi, François Lanusse, Casey Lam, Jessica Lu:
Real-Time Likelihood-Free Inference of Roman Binary Microlensing Events with Amortized Neural Posterior Estimation. CoRR abs/2102.05673 (2021) - Peter Kiss:
Improving update times of dynamic matching algorithms from amortized to worst case. CoRR abs/2108.10461 (2021) - 2020
- Marsden Jacques, Dennis Wong, Kyounga Woo:
Generating Gray codes for weak orders in constant amortized time. Discret. Math. 343(10): 111992 (2020) - Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada:
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. Theor. Comput. Sci. 842: 86-99 (2020) - Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada:
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. CoRR abs/2003.03222 (2020) - Sindy Löwe, David Madras, Richard S. Zemel, Max Welling:
Amortized Causal Discovery: Learning to Infer Causal Graphs from Time-Series Data. CoRR abs/2006.10833 (2020) - Victor Parque, Tomoyuki Miyashita:
An Efficient Scheme for the Generation of Ordered Trees in Constant Amortized Time. CoRR abs/2011.03636 (2020) - 2019
- Arthur Charguéraud, François Pottier:
Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits. J. Autom. Reason. 62(3): 331-365 (2019) - Bhadrachalam Chitturi, Priyanshu Das:
Sorting permutations with transpositions in O(n3) amortized time. Theor. Comput. Sci. 766: 30-37 (2019) - Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon:
(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. SODA 2019: 1886-1898 - Sayan Bhattacharya, Janardhan Kulkarni:
Deterministically Maintaining a (2 + ∊)-Approximate Minimum Vertex Cover in O(1/∊2) Amortized Update Time. SODA 2019: 1872-1885 - Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices. CoRR abs/1906.09680 (2019) - 2018
- Gramoz Goranci, Monika Henzinger, Mikkel Thorup:
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time. ACM Trans. Algorithms 14(2): 17:1-17:21 (2018) - Angelo Furfaro, Ludovica Sacco:
Adaptive Ladder Queue: Achieving O(1) Amortized Access Time in Practice. SIGSIM-PADS 2018: 101-104 - Manuel Pöter, Jesper Larsson Träff:
Stamp-it, amortized constant-time memory reclamation in comparison to five other schemes. PPoPP 2018: 413-414 - Jacob Holm, Eva Rotenberg, Mikkel Thorup:
Dynamic Bridge-Finding in Õ(log2 n) Amortized Time. SODA 2018: 35-52
skipping 24 more matches
loading more results
failed to load more results, please try again later
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-09-20 06:24 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