Остановите войну!
for scientists:
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 197 matches
- 2024
- Mehak, Dharmendra Prasad Mahato:
Hop-Constrained Oblivious Routing Using Prim's-Sollin's Algorithm. AINA (6) 2024: 444-452 - 2023
- Xinyu Hong, Na Lv, Zhiyuan Ren:
Oblivious neighbor discovery algorithms in airborne networks with directional multi-antenna. Ad Hoc Networks 141: 103074 (2023) - Xiang Li, Nuozhou Sun, Yunqian Luo, Mingyu Gao:
SODA: A Set of Fast Oblivious Algorithms in Distributed Secure Data Analytics. Proc. VLDB Endow. 16(7): 1671-1684 (2023) - Cho-Hsin Tsai, Chih-Chun Wang:
Distribution-Oblivious Online Algorithms for Age-of-Information Penalty Minimization. IEEE/ACM Trans. Netw. 31(4): 1779-1794 (2023) - Noah G. Singer:
Oblivious Algorithms for the Max-kAND Problem. APPROX/RANDOM 2023: 15:1-15:19 - Vijay V. Vazirani:
Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids. FSTTCS 2023: 21:1-21:14 - Maede Safari, Nezam Rohbani, Mohammad Arman Soleimani, Hamid Sarbazi-Azad:
OCRA: An Oblivious Congested Region Avoiding Routing Algorithm for 3D NoCs. NoCArc@MICRO 2023: 40-45 - Noah G. Singer:
Oblivious algorithms for the Max-kAND Problem. CoRR abs/2305.04438 (2023) - 2022
- T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi:
Foundations of Differentially Oblivious Algorithms. J. ACM 69(4): 27:1-27:49 (2022) - Ruosong Wang, David P. Woodruff:
Tight Bounds for ℓ1 Oblivious Subspace Embeddings. ACM Trans. Algorithms 18(1): 8:1-8:32 (2022) - Peyman Afshani, John Iacono, Varunkumar Jayapaul, Ben Karsin, Nodari Sitchinava:
Locality-of-Reference Optimality of Cache-Oblivious Algorithms. APOCS 2022: 31-45 - Arghya Bhattacharya, Abiyaz Chowdhury, Helen Xu, Rathish Das, Rezaul Alam Chowdhury, Rob Johnson, Rishab Nithyanand, Michael A. Bender:
When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting. ESA 2022: 16:1-16:17 - Yossi Azar, Eldad Peretz, Noam Touitou:
Distortion-Oblivious Algorithms for Scheduling on Multiple Machines. ISAAC 2022: 16:1-16:18 - Yossi Azar, Stefano Leonardi, Noam Touitou:
Distortion-Oblivious Algorithms for Minimizing Flow Time. SODA 2022: 252-274 - Pengbo Yan:
Proving Obliviousness of Probabilistic Algorithms with Formal Verification. SPLASH Companion 2022: 25-28 - Afonso Tinoco, Sixiang Gao, Elaine Shi:
EnigMap: Signal Should Use Oblivious Algorithms for Private Contact Discovery. IACR Cryptol. ePrint Arch. 2022: 1083 (2022) - 2021
- Jürgen Dölz, Herbert Egger, Vsevolod Shashkov:
A fast and oblivious matrix compression algorithm for Volterra integral operators. Adv. Comput. Math. 47(6): 81 (2021) - Gerth Stølting Brodal, Konstantinos Mampentzidis:
Cache Oblivious Algorithms for Computing the Triplet Distance between Trees. ACM J. Exp. Algorithmics 26: 1.2:1-1.2:44 (2021) - David G. Harris:
Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma. ACM Trans. Algorithms 17(1): 1:1-1:32 (2021) - Shumo Chu, Danyang Zhuo, Elaine Shi, T.-H. Hubert Chan:
Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms. ITC 2021: 19:1-19:24 - Yuan Tang, Weiguo Gao:
Processor-Aware Cache-Oblivious Algorithms✱. ICPP 2021: 55:1-55:10 - Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson:
Nearly-Tight and Oblivious Algorithms for Explainable Clustering. NeurIPS 2021: 28929-28939 - Vijaya Ramachandran, Elaine Shi:
Data Oblivious Algorithms for Multicores. SPAA 2021: 373-384 - Jeongseok Son, Griffin Prechter, Rishabh Poddar, Raluca Ada Popa, Koushik Sen:
ObliCheck: Efficient Verification of Oblivious Algorithms with Unobservable State. USENIX Security Symposium 2021: 2219-2236 - Jürgen Dölz, Herbert Egger, Vsevolod Shashkov:
A fast and oblivious matrix compression algorithm for Volterra integral operators. CoRR abs/2103.12834 (2021) - Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson:
Nearly-Tight and Oblivious Algorithms for Explainable Clustering. CoRR abs/2106.16147 (2021) - Yossi Azar, Stefano Leonardi, Noam Touitou:
Distortion-Oblivious Algorithms for Minimizing Flow Time. CoRR abs/2109.08424 (2021) - Shumo Chu, Danyang Zhuo, Elaine Shi, T.-H. Hubert Chan:
Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms. IACR Cryptol. ePrint Arch. 2021: 593 (2021) - 2020
- Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru, Sébastien Tixeuil:
Parameterized verification of algorithms for oblivious robots on a ring. Formal Methods Syst. Des. 56(1): 55-89 (2020) - Guy E. Blelloch, Yan Gu:
Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract]. APOCS 2020: 105-119
skipping 167 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-04-25 16:49 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