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 209 matches
- 2024
- Sandip Das, Subhadeep Ranjan Dev, Swami Sarvattomananda:
A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes. Discret. Appl. Math. 350: 44-61 (2024) - Diego Arroyuelo, Benjamin Bustos, Adrián Gómez-Brandón, Aidan Hogan, Gonzalo Navarro, Juan L. Reutter:
Worst-Case-Optimal Similarity Joins on Graph Databases. Proc. ACM Manag. Data 2(1): 39:1-39:26 (2024) - Diego Arroyuelo, Adrián Gómez-Brandón, Aidan Hogan, Gonzalo Navarro, Juan L. Reutter, Javiel Rojas-Ledesma, Adrián Soto:
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space. ACM Trans. Database Syst. 49(2): 5:1-5:45 (2024) - Mingdao Li, Peng Peng, Zheyuan Hu, Lei Zou, Zheng Qin:
Variable-Length Path Query Evaluation Based on Worst-Case Optimal Joins. ICDE 2024: 3311-3323 - Xiao Mao:
Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time. STOC 2024: 1141-1152 - Nikhil Bansal, Vincent Cohen-Addad, Milind Prabhu, David Saulpic, Chris Schwiegelshohn:
Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds. CoRR abs/2405.01339 (2024) - 2023
- Saeid Shakerinia, Abbas Fattahi Meyabadi, Mojtaba Vahedi, Nasrin Salehi, Mahmoud Samiei Moghaddam:
Optimal Operation of Microgrids With Worst-Case Renewable Energy Outage: A Mixed-Integer Bi-Level Model. IEEE Access 11: 59804-59815 (2023) - Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Packing Disks into Disks with Optimal Worst-Case Density. Discret. Comput. Geom. 69(1): 51-90 (2023) - Yisu Remy Wang, Max Willsey, Dan Suciu:
Free Join: Unifying Worst-Case Optimal and Traditional Joins. Proc. ACM Manag. Data 1(2): 150:1-150:23 (2023) - Ou Wu, Shanshan Li, He Zhang, Liwen Liu, Haoming Li, Yanze Wang, Ziyi Zhang:
An optimal scheduling algorithm considering the transactions worst-case delay for multi-channel hyperledger fabric network. Parallel Comput. 117: 103041 (2023) - Junxiong Wang, Mitchell Gray, Immanuel Trummer, Ahmet Kara, Dan Olteanu:
Demonstrating ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Joins via Reinforcement Learning. Proc. VLDB Endow. 16(12): 4094-4097 (2023) - Junxiong Wang, Immanuel Trummer, Ahmet Kara, Dan Olteanu:
ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Join Algorithms via Reinforcement Learning. Proc. VLDB Endow. 16(11): 2805-2817 (2023) - Andrew Lowy, Meisam Razaviyayn:
Private Stochastic Optimization with Large Worst-Case Lipschitz Parameter: Optimal Rates for (Non-Smooth) Convex Losses and Extension to Non-Convex Losses. ALT 2023: 986-1054 - Rodrigo Aldana-López, Richard Seeber, Hernan Haimovich, David Gómez-Gutiérrez:
Exact Differentiator with Lipschitz Continuous Output and Optimal Worst-Case Accuracy Under Bounded Noise. CDC 2023: 7874-7880 - Ayoub Berdai, Dalila Chiadmi:
Attempts in Worst-Case Optimal Joins on Relational Data Systems: A Literature Survey. CloudTech 2023: 1-8 - Ahmad Khazaie, Holger Pirk:
SonicJoin: Fast, Robust and Worst-case Optimal. EDBT 2023: 540-551 - Trung Dang, Jasper C. H. Lee, Maoyuan Raymond Song, Paul Valiant:
Optimality in Mean Estimation: Beyond Worst-Case, Beyond Sub-Gaussian, and Beyond 1+α Moments. NeurIPS 2023 - Yisu Remy Wang, Max Willsey, Dan Suciu:
Free Join: Unifying Worst-Case Optimal and Traditional Joins. CoRR abs/2301.10841 (2023) - Xiao Mao:
Fully-Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time. CoRR abs/2306.02662 (2023) - Junxiong Wang, Immanuel Trummer, Ahmet Kara, Dan Olteanu:
ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Join Algorithms via Reinforcement Learning. CoRR abs/2307.16540 (2023) - Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps. CoRR abs/2311.11793 (2023) - Trung Dang, Jasper C. H. Lee, Maoyuan Song, Paul Valiant:
Optimality in Mean Estimation: Beyond Worst-Case, Beyond Sub-Gaussian, and Beyond 1+α Moments. CoRR abs/2311.12784 (2023) - 2022
- Wei Liu, Yang Liu:
Worst-Case Higher Moment Coherent Risk Based on Optimal Transport with Application to Distributionally Robust Portfolio Optimization. Symmetry 14(1): 138 (2022) - Travis Gagie:
Simple Worst-Case Optimal Adaptive Prefix-Free Coding. DCC 2022: 453 - Travis Gagie:
Simple Worst-Case Optimal Adaptive Prefix-Free Coding. ESA 2022: 57:1-57:5 - Frédéric Cérou, Patrick Héas, Mathias Rousset:
Entropy minimizing distributions are worst-case optimal importance proposals. CoRR abs/2212.04292 (2022) - 2021
- Xiangrui Zeng, Junmin Wang:
Worst-case relative cost optimal control for dynamic systems with finite admissible disturbance sequence sets. Int. J. Control 94(8): 2296-2303 (2021) - Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
Worst-Case Optimal Squares Packing into Disks. J. Comput. Geom. 12(2): 149-175 (2021) - Cheng Siong Chin, Ronghui Zhang:
Noise modeling of offshore platform using progressive normalized distance from worst-case error for optimal neuron numbers in deep belief network. Soft Comput. 25(1): 495-515 (2021) - Amine Mhedhbi, Chathura Kankanamge, Semih Salihoglu:
Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins. ACM Trans. Database Syst. 46(2): 6:1-6:45 (2021)
skipping 179 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-23 09:42 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