![](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
- Aaron Bernstein
Rutgers University, New Brunswick, USA
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 108 matches
- 2024
- Aaron Bernstein, Greg Bodwin, Nicole Wein:
Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights? ITCS 2024: 12:1-12:22 - Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu:
Maximum Flow by Augmenting Paths in n2+o(1) Time. CoRR abs/2406.03648 (2024) - 2023
- Sai Praveen Bangaru, Lifan Wu, Tzu-Mao Li, Jacob Munkberg, Gilbert Bernstein, Jonathan Ragan-Kelley, Frédo Durand, Aaron E. Lefohn, Yong He:
SLANG.D: Fast, Modular and Differentiable Shader Programming. ACM Trans. Graph. 42(6): 264:1-264:28 (2023) - Sepehr Assadi, Aaron Bernstein, Zachary Langley:
All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method. ITCS 2023: 7:1-7:24 - Aaron Bernstein, Nicole Wein:
Closing the Gap Between Directed Hopsets and Shortcut Sets. SODA 2023: 163-182 - Sepehr Assadi, Aaron Bernstein, Zachary Langley:
All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method. CoRR abs/2301.07007 (2023) - Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su:
Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights. CoRR abs/2303.00811 (2023) - Aaron Bernstein, Greg Bodwin, Nicole Wein:
Are there graphs whose shortest path structure requires large edge weights? CoRR abs/2308.13054 (2023) - 2022
- Aaron Bernstein, Yann Disser
, Martin Groß, Sandra Himburg:
General bounds for incremental maximization. Math. Program. 191(2): 953-979 (2022) - Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen:
Negative-Weight Single-Source Shortest Paths in Near-linear Time. FOCS 2022: 600-611 - Sepehr Assadi, Aaron Bernstein, Aditi Dudeja:
Decremental Matching in General Graphs. ICALP 2022: 11:1-11:19 - Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg
, Danupon Nanongkai, Thatchaphol Saranurak
, Aaron Sidford, He Sun:
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. ICALP 2022: 20:1-20:20 - Romal Thoppilan, Daniel De Freitas, Jamie Hall, Noam Shazeer, Apoorv Kulshreshtha, Heng-Tze Cheng, Alicia Jin, Taylor Bos, Leslie Baker, Yu Du, YaGuang Li, Hongrae Lee, Huaixiu Steven Zheng, Amin Ghafouri, Marcelo Menegali, Yanping Huang, Maxim Krikun, Dmitry Lepikhin, James Qin, Dehao Chen, Yuanzhong Xu, Zhifeng Chen, Adam Roberts, Maarten Bosma, Yanqi Zhou, Chung-Ching Chang, Igor Krivokon, Will Rusch, Marc Pickett, Kathleen S. Meier-Hellstern, Meredith Ringel Morris, Tulsee Doshi, Renelito Delos Santos, Toju Duke, Johnny Soraker, Ben Zevenbergen, Vinodkumar Prabhakaran, Mark Diaz, Ben Hutchinson, Kristen Olson, Alejandra Molina, Erin Hoffman-John, Josh Lee, Lora Aroyo, Ravi Rajakumar, Alena Butryna, Matthew Lamm, Viktoriya Kuzmina, Joe Fenton, Aaron Cohen, Rachel Bernstein, Ray Kurzweil, Blaise Agüera y Arcas, Claire Cui, Marian Croak, Ed H. Chi, Quoc Le:
LaMDA: Language Models for Dialog Applications. CoRR abs/2201.08239 (2022) - Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen:
Negative-Weight Single-Source Shortest Paths in Almost-linear Time. CoRR abs/2203.03456 (2022) - Sepehr Assadi, Aaron Bernstein, Aditi Dudeja:
Decremental Matching in General Graphs. CoRR abs/2207.00927 (2022) - Aaron Bernstein, Nicole Wein:
Closing the Gap Between Directed Hopsets and Shortcut Sets. CoRR abs/2207.04507 (2022) - Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, Nicole Wein:
Dynamic Graph Algorithms (Dagstuhl Seminar 22461). Dagstuhl Reports 12(11): 45-65 (2022) - 2021
- Aaron Bernstein, Sebastian Forster
, Monika Henzinger
:
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. ACM Trans. Algorithms 17(4): 29:1-29:51 (2021) - Aaron Bernstein, Aditi Dudeja, Seth Pettie:
Incremental SCC Maintenance in Sparse Graphs. ESA 2021: 14:1-14:16 - Aaron Bernstein, Maximilian Probst Gutenberg
, Thatchaphol Saranurak
:
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. FOCS 2021: 1000-1008 - Aaron Bernstein, Aditi Dudeja, Zachary Langley
:
A framework for dynamic matching in weighted graphs. STOC 2021: 668-681 - Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. CoRR abs/2101.07149 (2021) - 2020
- Ankit Goel, Brandon Ponder, Aaron J. Ridley, Dennis S. Bernstein:
Estimation of Thermal-Conductivity Coefficients in the Global Ionosphere-Thermosphere Model. J. Aerosp. Inf. Syst. 17(9): 546-553 (2020) - Aaron Bernstein, Maximilian Probst Gutenberg
, Thatchaphol Saranurak
:
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. FOCS 2020: 1123-1134 - Aaron Bernstein, Maximilian Probst Gutenberg
, Christian Wulff-Nilsen:
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. FOCS 2020: 1112-1122 - Aaron Bernstein, Aditi Dudeja:
Online Matching with Recourse: Random Edge Arrivals. FSTTCS 2020: 11:1-11:16 - Aaron Bernstein:
Improved Bounds for Matching in Random-Order Streams. ICALP 2020: 12:1-12:13 - Sepehr Assadi, Aaron Bernstein, Zachary Langley
:
Improved Bounds for Distributed Load Balancing. DISC 2020: 1:1-1:15 - Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. CoRR abs/2004.04496 (2020) - Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun:
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. CoRR abs/2004.08432 (2020)
skipping 78 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-07-27 15:33 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