default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Aaron Bernstein
@inproceedings{DBLP:conf/soda/Bernstein026,
author = {Aaron Bernstein and
Jiale Chen},
editor = {Kasper Green Larsen and
Barna Saha},
title = {From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs:
{A} Low-Loss Reduction},
booktitle = {Proceedings of the 2026 Annual {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2026, Vancouver, BC, Canada, January 11-14, 2026},
pages = {217--246},
publisher = {{SIAM}},
year = {2026},
url = {https://doi.org/10.1137/1.9781611978971.10},
doi = {10.1137/1.9781611978971.10},
timestamp = {Thu, 19 Feb 2026 16:57:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/Bernstein026.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernsteinBFKS26,
author = {Aaron Bernstein and
Sayan Bhattacharya and
Nick Fischer and
Peter Kiss and
Thatchaphol Saranurak},
editor = {Kasper Green Larsen and
Barna Saha},
title = {Separations between Oblivious and Adaptive Adversaries for Natural
Dynamic Graph Problems},
booktitle = {Proceedings of the 2026 Annual {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2026, Vancouver, BC, Canada, January 11-14, 2026},
pages = {5669--5687},
publisher = {{SIAM}},
year = {2026},
url = {https://doi.org/10.1137/1.9781611978971.202},
doi = {10.1137/1.9781611978971.202},
timestamp = {Thu, 19 Feb 2026 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BernsteinBFKS26.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/BernsteinNW25,
author = {Aaron Bernstein and
Danupon Nanongkai and
Christian Wulff{-}Nilsen},
title = {Negative-Weight Single-Source Shortest Paths in Near-Linear Time},
journal = {Commun. {ACM}},
volume = {68},
number = {2},
pages = {87--94},
year = {2025},
url = {https://doi.org/10.1145/3631536},
doi = {10.1145/3631536},
timestamp = {Fri, 21 Feb 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/BernsteinNW25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BernsteinNW25,
author = {Aaron Bernstein and
Danupon Nanongkai and
Christian Wulff{-}Nilsen},
title = {Negative-Weight Single-Source Shortest Paths in Near-linear Time},
journal = {J. {ACM}},
volume = {72},
number = {4},
pages = {23:1--23:34},
year = {2025},
url = {https://doi.org/10.1145/3742890},
doi = {10.1145/3742890},
timestamp = {Thu, 11 Sep 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BernsteinNW25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BernsteinBLST25,
author = {Aaron Bernstein and
Joakim Blikstad and
Jason Li and
Thatchaphol Saranurak and
Ta{-}Wei Tu},
title = {Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs},
booktitle = {66th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2025, Sydney, Australia, December 14-17, 2025},
pages = {464--485},
publisher = {{IEEE}},
year = {2025},
url = {https://doi.org/10.1109/FOCS63196.2025.00026},
doi = {10.1109/FOCS63196.2025.00026},
timestamp = {Tue, 17 Feb 2026 08:37:29 +0100},
biburl = {https://dblp.org/rec/conf/focs/BernsteinBLST25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AshvinkumarBD0W25,
author = {Vikrant Ashvinkumar and
Aaron Bernstein and
Chengyuan Deng and
Jie Gao and
Nicole Wein},
editor = {Raghu Meka},
title = {Low Sensitivity Hopsets},
booktitle = {16th Innovations in Theoretical Computer Science Conference, {ITCS}
2025, Columbia University, New York, NY, USA, January 7-10, 2025},
series = {LIPIcs},
volume = {325},
pages = {13:1--13:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2025},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2025.13},
doi = {10.4230/LIPICS.ITCS.2025.13},
timestamp = {Fri, 21 Nov 2025 23:44:11 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AshvinkumarBD0W25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bernstein0DLST25,
author = {Aaron Bernstein and
Jiale Chen and
Aditi Dudeja and
Zachary Langley and
Aaron Sidford and
Ta{-}Wei Tu},
editor = {Yossi Azar and
Debmalya Panigrahi},
title = {Matching Composition and Efficient Weight Reduction in Dynamic Matching},
booktitle = {Proceedings of the 2025 Annual {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2025, New Orleans, LA, USA, January 12-15, 2025},
pages = {2991--3028},
publisher = {{SIAM}},
year = {2025},
url = {https://doi.org/10.1137/1.9781611978322.97},
doi = {10.1137/1.9781611978322.97},
timestamp = {Sun, 01 Feb 2026 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Bernstein0DLST25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiBLL025,
author = {Sepehr Assadi and
Aaron Bernstein and
Zachary Langley and
Lap Chi Lau and
Robert Wang},
editor = {Yossi Azar and
Debmalya Panigrahi},
title = {Streaming and Communication Complexity of Load-Balancing via Matching
Contractors},
booktitle = {Proceedings of the 2025 Annual {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2025, New Orleans, LA, USA, January 12-15, 2025},
pages = {3423--3449},
publisher = {{SIAM}},
year = {2025},
url = {https://doi.org/10.1137/1.9781611978322.113},
doi = {10.1137/1.9781611978322.113},
timestamp = {Tue, 28 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AssadiBLL025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AshvinkumarBK25,
author = {Vikrant Ashvinkumar and
Aaron Bernstein and
Adam Karczmarz},
editor = {Yossi Azar and
Debmalya Panigrahi},
title = {Faster Approximation Algorithms for Restricted Shortest Paths in Directed
Graphs},
booktitle = {Proceedings of the 2025 Annual {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2025, New Orleans, LA, USA, January 12-15, 2025},
pages = {5263--5277},
publisher = {{SIAM}},
year = {2025},
url = {https://doi.org/10.1137/1.9781611978322.180},
doi = {10.1137/1.9781611978322.180},
timestamp = {Tue, 28 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AshvinkumarBK25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BernsteinBKS25,
author = {Aaron Bernstein and
Sayan Bhattacharya and
Peter Kiss and
Thatchaphol Saranurak},
editor = {Michal Kouck{\'{y}} and
Nikhil Bansal},
title = {Deterministic Dynamic Maximal Matching in Sublinear Update Time},
booktitle = {Proceedings of the 57th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2025, Prague, Czechia, June 23-27, 2025},
pages = {132--143},
publisher = {{ACM}},
year = {2025},
url = {https://doi.org/10.1145/3717823.3718153},
doi = {10.1145/3717823.3718153},
timestamp = {Sun, 02 Nov 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BernsteinBKS25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2504-20780,
author = {Aaron Bernstein and
Sayan Bhattacharya and
Peter Kiss and
Thatchaphol Saranurak},
title = {Deterministic Dynamic Maximal Matching in Sublinear Update Time},
journal = {CoRR},
volume = {abs/2504.20780},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2504.20780},
doi = {10.48550/ARXIV.2504.20780},
eprinttype = {arXiv},
eprint = {2504.20780},
timestamp = {Fri, 04 Jul 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2504-20780.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2510-17182,
author = {Aaron Bernstein and
Joakim Blikstad and
Jason Li and
Thatchaphol Saranurak and
Ta{-}Wei Tu},
title = {Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs},
journal = {CoRR},
volume = {abs/2510.17182},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2510.17182},
doi = {10.48550/ARXIV.2510.17182},
eprinttype = {arXiv},
eprint = {2510.17182},
timestamp = {Sun, 07 Dec 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2510-17182.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2510-19049,
author = {Aaron Bernstein and
Jiale Chen},
title = {From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs:
{A} Low-Loss Reduction},
journal = {CoRR},
volume = {abs/2510.19049},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2510.19049},
doi = {10.48550/ARXIV.2510.19049},
eprinttype = {arXiv},
eprint = {2510.19049},
timestamp = {Thu, 19 Feb 2026 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2510-19049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2510-20341,
author = {Aaron Bernstein and
Sayan Bhattacharya and
Nick Fischer and
Peter Kiss and
Thatchaphol Saranurak},
title = {Separations between Oblivious and Adaptive Adversaries for Natural
Dynamic Graph Problems},
journal = {CoRR},
volume = {abs/2510.20341},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2510.20341},
doi = {10.48550/ARXIV.2510.20341},
eprinttype = {arXiv},
eprint = {2510.20341},
timestamp = {Sun, 07 Dec 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2510-20341.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2510-24954,
author = {Aaron Bernstein and
Henry L. Fleischmann and
Maximilian Probst Gutenberg and
Bernhard Haeupler and
Gary Hoppenworth and
Yonggang Jiang and
George Z. Li and
Seth Pettie and
Thatchaphol Saranurak and
Leon Schiller},
title = {Reviving Thorup's Shortcut Conjecture},
journal = {CoRR},
volume = {abs/2510.24954},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2510.24954},
doi = {10.48550/ARXIV.2510.24954},
eprinttype = {arXiv},
eprint = {2510.24954},
timestamp = {Sun, 07 Dec 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2510-24954.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Bernstein24,
author = {Aaron Bernstein},
title = {Improved Bounds for Matching in Random-Order Streams},
journal = {Theory Comput. Syst.},
volume = {68},
number = {4},
pages = {758--772},
year = {2024},
url = {https://doi.org/10.1007/s00224-023-10155-7},
doi = {10.1007/S00224-023-10155-7},
timestamp = {Thu, 05 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Bernstein24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AshvinkumarBCGH24,
author = {Vikrant Ashvinkumar and
Aaron Bernstein and
Nairen Cao and
Christoph Grunau and
Bernhard Haeupler and
Yonggang Jiang and
Danupon Nanongkai and
Hsin{-}Hao Su},
editor = {Timothy M. Chan and
Johannes Fischer and
John Iacono and
Grzegorz Herman},
title = {Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths
with Negative Edge Weights},
booktitle = {32nd Annual European Symposium on Algorithms, {ESA} 2024, Royal Holloway,
London, United Kingdom, September 2-4, 2024},
series = {LIPIcs},
volume = {308},
pages = {13:1--13:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ESA.2024.13},
doi = {10.4230/LIPICS.ESA.2024.13},
timestamp = {Fri, 21 Nov 2025 23:44:11 +0100},
biburl = {https://dblp.org/rec/conf/esa/AshvinkumarBCGH24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BernsteinBST24,
author = {Aaron Bernstein and
Joakim Blikstad and
Thatchaphol Saranurak and
Ta{-}Wei Tu},
title = {Maximum Flow by Augmenting Paths in n\({}^{\mbox{2+o(1)}}\) Time},
booktitle = {65th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2024, Chicago, IL, USA, October 27-30, 2024},
pages = {2056--2077},
publisher = {{IEEE}},
year = {2024},
url = {https://doi.org/10.1109/FOCS61266.2024.00123},
doi = {10.1109/FOCS61266.2024.00123},
timestamp = {Tue, 08 Jul 2025 16:39:50 +0200},
biburl = {https://dblp.org/rec/conf/focs/BernsteinBST24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BernsteinBW24,
author = {Aaron Bernstein and
Greg Bodwin and
Nicole Wein},
editor = {Venkatesan Guruswami},
title = {Are There Graphs Whose Shortest Path Structure Requires Large Edge
Weights?},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, Berkeley, CA, USA, January 30 - February 2, 2024},
series = {LIPIcs},
volume = {287},
pages = {12:1--12:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.12},
doi = {10.4230/LIPICS.ITCS.2024.12},
timestamp = {Fri, 21 Nov 2025 23:44:11 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BernsteinBW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2406-03648,
author = {Aaron Bernstein and
Joakim Blikstad and
Thatchaphol Saranurak and
Ta{-}Wei Tu},
title = {Maximum Flow by Augmenting Paths in n\({}^{\mbox{2+o(1)}}\) Time},
journal = {CoRR},
volume = {abs/2406.03648},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2406.03648},
doi = {10.48550/ARXIV.2406.03648},
eprinttype = {arXiv},
eprint = {2406.03648},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2406-03648.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2407-10249,
author = {Vikrant Ashvinkumar and
Aaron Bernstein and
Chengyuan Deng and
Jie Gao and
Nicole Wein},
title = {Low Sensitivity Hopsets},
journal = {CoRR},
volume = {abs/2407.10249},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2407.10249},
doi = {10.48550/ARXIV.2407.10249},
eprinttype = {arXiv},
eprint = {2407.10249},
timestamp = {Thu, 15 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2407-10249.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2410-16094,
author = {Sepehr Assadi and
Aaron Bernstein and
Zachary Langley and
Lap Chi Lau and
Robert Wang},
title = {Streaming and Communication Complexity of Load-Balancing via Matching
Contractors},
journal = {CoRR},
volume = {abs/2410.16094},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2410.16094},
doi = {10.48550/ARXIV.2410.16094},
eprinttype = {arXiv},
eprint = {2410.16094},
timestamp = {Tue, 26 Nov 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2410-16094.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2410-17179,
author = {Vikrant Ashvinkumar and
Aaron Bernstein and
Adam Karczmarz},
title = {Faster Approximation Algorithms for Restricted Shortest Paths in Directed
Graphs},
journal = {CoRR},
volume = {abs/2410.17179},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2410.17179},
doi = {10.48550/ARXIV.2410.17179},
eprinttype = {arXiv},
eprint = {2410.17179},
timestamp = {Wed, 27 Nov 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2410-17179.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2410-18936,
author = {Aaron Bernstein and
Jiale Chen and
Aditi Dudeja and
Zachary Langley and
Aaron Sidford and
Ta{-}Wei Tu},
title = {Matching Composition and Efficient Weight Reduction in Dynamic Matching},
journal = {CoRR},
volume = {abs/2410.18936},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2410.18936},
doi = {10.48550/ARXIV.2410.18936},
eprinttype = {arXiv},
eprint = {2410.18936},
timestamp = {Mon, 02 Dec 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2410-18936.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AssadiBL23,
author = {Sepehr Assadi and
Aaron Bernstein and
Zachary Langley},
editor = {Yael Tauman Kalai},
title = {All-Norm Load Balancing in Graph Streams via the Multiplicative Weights
Update Method},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, MIT, Cambridge, Massachusetts, USA, January 10-13, 2023},
series = {LIPIcs},
volume = {251},
pages = {7:1--7:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.7},
doi = {10.4230/LIPICS.ITCS.2023.7},
timestamp = {Fri, 21 Nov 2025 23:44:11 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AssadiBL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernsteinW23,
author = {Aaron Bernstein and
Nicole Wein},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Closing the Gap Between Directed Hopsets and Shortcut Sets},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {163--182},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch7},
doi = {10.1137/1.9781611977554.CH7},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/BernsteinW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-07007,
author = {Sepehr Assadi and
Aaron Bernstein and
Zachary Langley},
title = {All-Norm Load Balancing in Graph Streams via the Multiplicative Weights
Update Method},
journal = {CoRR},
volume = {abs/2301.07007},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.07007},
doi = {10.48550/ARXIV.2301.07007},
eprinttype = {arXiv},
eprint = {2301.07007},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-07007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-00811,
author = {Vikrant Ashvinkumar and
Aaron Bernstein and
Nairen Cao and
Christoph Grunau and
Bernhard Haeupler and
Yonggang Jiang and
Danupon Nanongkai and
Hsin{-}Hao Su},
title = {Parallel and Distributed Exact Single-Source Shortest Paths with Negative
Edge Weights},
journal = {CoRR},
volume = {abs/2303.00811},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.00811},
doi = {10.48550/ARXIV.2303.00811},
eprinttype = {arXiv},
eprint = {2303.00811},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-00811.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-13054,
author = {Aaron Bernstein and
Greg Bodwin and
Nicole Wein},
title = {Are there graphs whose shortest path structure requires large edge
weights?},
journal = {CoRR},
volume = {abs/2308.13054},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.13054},
doi = {10.48550/ARXIV.2308.13054},
eprinttype = {arXiv},
eprint = {2308.13054},
timestamp = {Fri, 01 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-13054.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BernsteinD0H22,
author = {Aaron Bernstein and
Yann Disser and
Martin Gro{\ss} and
Sandra Himburg},
title = {General bounds for incremental maximization},
journal = {Math. Program.},
volume = {191},
number = {2},
pages = {953--979},
year = {2022},
url = {https://doi.org/10.1007/s10107-020-01576-0},
doi = {10.1007/S10107-020-01576-0},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BernsteinD0H22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BernsteinNW22,
author = {Aaron Bernstein and
Danupon Nanongkai and
Christian Wulff{-}Nilsen},
title = {Negative-Weight Single-Source Shortest Paths in Near-linear Time},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {600--611},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00063},
doi = {10.1109/FOCS54457.2022.00063},
timestamp = {Tue, 08 Jul 2025 16:39:27 +0200},
biburl = {https://dblp.org/rec/conf/focs/BernsteinNW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AssadiBD22,
author = {Sepehr Assadi and
Aaron Bernstein and
Aditi Dudeja},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Decremental Matching in General Graphs},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, Paris, France, July 4-8, 2022},
series = {LIPIcs},
volume = {229},
pages = {11:1--11:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.11},
doi = {10.4230/LIPICS.ICALP.2022.11},
timestamp = {Fri, 21 Nov 2025 23:44:11 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AssadiBD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BernsteinBGNSS022,
author = {Aaron Bernstein and
Jan van den Brand and
Maximilian Probst Gutenberg and
Danupon Nanongkai and
Thatchaphol Saranurak and
Aaron Sidford and
He Sun},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, Paris, France, July 4-8, 2022},
series = {LIPIcs},
volume = {229},
pages = {20:1--20:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.20},
doi = {10.4230/LIPICS.ICALP.2022.20},
timestamp = {Tue, 01 Apr 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BernsteinBGNSS022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-03456,
author = {Aaron Bernstein and
Danupon Nanongkai and
Christian Wulff{-}Nilsen},
title = {Negative-Weight Single-Source Shortest Paths in Almost-linear Time},
journal = {CoRR},
volume = {abs/2203.03456},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.03456},
doi = {10.48550/ARXIV.2203.03456},
eprinttype = {arXiv},
eprint = {2203.03456},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-03456.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-00927,
author = {Sepehr Assadi and
Aaron Bernstein and
Aditi Dudeja},
title = {Decremental Matching in General Graphs},
journal = {CoRR},
volume = {abs/2207.00927},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.00927},
doi = {10.48550/ARXIV.2207.00927},
eprinttype = {arXiv},
eprint = {2207.00927},
timestamp = {Wed, 06 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-00927.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-04507,
author = {Aaron Bernstein and
Nicole Wein},
title = {Closing the Gap Between Directed Hopsets and Shortcut Sets},
journal = {CoRR},
volume = {abs/2207.04507},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.04507},
doi = {10.48550/ARXIV.2207.04507},
eprinttype = {arXiv},
eprint = {2207.04507},
timestamp = {Wed, 13 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-04507.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BernsteinCFKNW22,
author = {Aaron Bernstein and
Shiri Chechik and
Sebastian Forster and
Tsvi Kopelowitz and
Yasamin Nazari and
Nicole Wein},
title = {Dynamic Graph Algorithms (Dagstuhl Seminar 22461)},
journal = {Dagstuhl Reports},
volume = {12},
number = {11},
pages = {45--65},
year = {2022},
url = {https://doi.org/10.4230/DagRep.12.11.45},
doi = {10.4230/DAGREP.12.11.45},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BernsteinCFKNW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BernsteinFH21,
author = {Aaron Bernstein and
Sebastian Forster and
Monika Henzinger},
title = {A Deamortization Approach for Dynamic Spanner and Dynamic Maximal
Matching},
journal = {{ACM} Trans. Algorithms},
volume = {17},
number = {4},
pages = {29:1--29:51},
year = {2021},
url = {https://doi.org/10.1145/3469833},
doi = {10.1145/3469833},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BernsteinFH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BernsteinDP21,
author = {Aaron Bernstein and
Aditi Dudeja and
Seth Pettie},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Incremental {SCC} Maintenance in Sparse Graphs},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, Lisbon,
Portugal (Virtual Conference), September 6-8, 2021},
series = {LIPIcs},
volume = {204},
pages = {14:1--14:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.14},
doi = {10.4230/LIPICS.ESA.2021.14},
timestamp = {Fri, 21 Nov 2025 23:44:11 +0100},
biburl = {https://dblp.org/rec/conf/esa/BernsteinDP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BernsteinGS21,
author = {Aaron Bernstein and
Maximilian Probst Gutenberg and
Thatchaphol Saranurak},
title = {Deterministic Decremental {SSSP} and Approximate Min-Cost Flow in
Almost-Linear Time},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1000--1008},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00100},
doi = {10.1109/FOCS52979.2021.00100},
timestamp = {Tue, 08 Jul 2025 16:39:17 +0200},
biburl = {https://dblp.org/rec/conf/focs/BernsteinGS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BernsteinDL21,
author = {Aaron Bernstein and
Aditi Dudeja and
Zachary Langley},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A framework for dynamic matching in weighted graphs},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {668--681},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451113},
doi = {10.1145/3406325.3451113},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BernsteinDL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-07149,
author = {Aaron Bernstein and
Maximilian Probst Gutenberg and
Thatchaphol Saranurak},
title = {Deterministic Decremental {SSSP} and Approximate Min-Cost Flow in
Almost-Linear Time},
journal = {CoRR},
volume = {abs/2101.07149},
year = {2021},
url = {https://arxiv.org/abs/2101.07149},
eprinttype = {arXiv},
eprint = {2101.07149},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-07149.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BernsteinGW20,
author = {Aaron Bernstein and
Maximilian Probst Gutenberg and
Christian Wulff{-}Nilsen},
editor = {Sandy Irani},
title = {Near-Optimal Decremental {SSSP} in Dense Weighted Digraphs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1112--1122},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00107},
doi = {10.1109/FOCS46700.2020.00107},
timestamp = {Tue, 08 Jul 2025 16:39:04 +0200},
biburl = {https://dblp.org/rec/conf/focs/BernsteinGW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BernsteinGS20,
author = {Aaron Bernstein and
Maximilian Probst Gutenberg and
Thatchaphol Saranurak},
editor = {Sandy Irani},
title = {Deterministic Decremental Reachability, SCC, and Shortest Paths via
Directed Expanders and Congestion Balancing},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1123--1134},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00108},
doi = {10.1109/FOCS46700.2020.00108},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BernsteinGS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BernsteinD20,
author = {Aaron Bernstein and
Aditi Dudeja},
editor = {Nitin Saxena and
Sunil Simon},
title = {Online Matching with Recourse: Random Edge Arrivals},
booktitle = {40th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2020, {BITS} Pilani, {K}
{K} Birla Goa Campus, Goa, India (Virtual Conference), December 14-18,
2020},
series = {LIPIcs},
volume = {182},
pages = {11:1--11:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.11},
doi = {10.4230/LIPICS.FSTTCS.2020.11},
timestamp = {Fri, 21 Nov 2025 14:06:54 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BernsteinD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Bernstein20,
author = {Aaron Bernstein},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Improved Bounds for Matching in Random-Order Streams},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, Saarbr{\"{u}}cken, Germany (Virtual Conference),
July 8-11, 2020},
series = {LIPIcs},
volume = {168},
pages = {12:1--12:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.12},
doi = {10.4230/LIPICS.ICALP.2020.12},
timestamp = {Fri, 21 Nov 2025 23:44:11 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Bernstein20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AssadiBL20,
author = {Sepehr Assadi and
Aaron Bernstein and
Zachary Langley},
editor = {Hagit Attiya},
title = {Improved Bounds for Distributed Load Balancing},
booktitle = {34th International Symposium on Distributed Computing, {DISC} 2020,
Virtual Conference, October 12-16, 2020},
series = {LIPIcs},
volume = {179},
pages = {1:1--1:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.DISC.2020.1},
doi = {10.4230/LIPICS.DISC.2020.1},
timestamp = {Fri, 21 Nov 2025 23:44:11 +0100},
biburl = {https://dblp.org/rec/conf/wdag/AssadiBL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-04496,
author = {Aaron Bernstein and
Maximilian Probst Gutenberg and
Christian Wulff{-}Nilsen},
title = {Near-Optimal Decremental {SSSP} in Dense Weighted Digraphs},
journal = {CoRR},
volume = {abs/2004.04496},
year = {2020},
url = {https://arxiv.org/abs/2004.04496},
eprinttype = {arXiv},
eprint = {2004.04496},
timestamp = {Tue, 14 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-04496.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-08432,
author = {Aaron Bernstein and
Jan van den Brand and
Maximilian Probst Gutenberg and
Danupon Nanongkai and
Thatchaphol Saranurak and
Aaron Sidford and
He Sun},
title = {Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary},
journal = {CoRR},
volume = {abs/2004.08432},
year = {2020},
url = {https://arxiv.org/abs/2004.08432},
eprinttype = {arXiv},
eprint = {2004.08432},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-08432.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-00417,
author = {Aaron Bernstein},
title = {Improved Bound for Matching in Random-Order Streams},
journal = {CoRR},
volume = {abs/2005.00417},
year = {2020},
url = {https://arxiv.org/abs/2005.00417},
eprinttype = {arXiv},
eprint = {2005.00417},
timestamp = {Fri, 08 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-00417.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-04148,
author = {Sepehr Assadi and
Aaron Bernstein and
Zachary Langley},
title = {Improved Bounds for Distributed Load Balancing},
journal = {CoRR},
volume = {abs/2008.04148},
year = {2020},
url = {https://arxiv.org/abs/2008.04148},
eprinttype = {arXiv},
eprint = {2008.04148},
timestamp = {Fri, 14 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-04148.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-02584,
author = {Aaron Bernstein and
Maximilian Probst Gutenberg and
Thatchaphol Saranurak},
title = {Deterministic Decremental Reachability, SCC, and Shortest Paths via
Directed Expanders and Congestion Balancing},
journal = {CoRR},
volume = {abs/2009.02584},
year = {2020},
url = {https://arxiv.org/abs/2009.02584},
eprinttype = {arXiv},
eprint = {2009.02584},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-02584.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BernsteinHR19,
author = {Aaron Bernstein and
Jacob Holm and
Eva Rotenberg},
title = {Online Bipartite Matching with Amortized \emph{O}(log \({}^{\mbox{2}}\)
\emph{n}) Replacements},
journal = {J. {ACM}},
volume = {66},
number = {5},
pages = {37:1--37:23},
year = {2019},
url = {https://doi.org/10.1145/3344999},
doi = {10.1145/3344999},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BernsteinHR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BernsteinN19,
author = {Aaron Bernstein and
Danupon Nanongkai},
title = {Distributed Exact Weighted All-Pairs Shortest Paths in Randomized
Near-Linear Time},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {on},
pages = {STOC19--112--STOC19--127},
year = {2019},
url = {https://doi.org/10.1137/20m1312782},
doi = {10.1137/20M1312782},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BernsteinN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BernsteinGW19,
author = {Aaron Bernstein and
Maximilian Probst Gutenberg and
Christian Wulff{-}Nilsen},
title = {Decremental Strongly Connected Components and Single-Source Reachability
in Near-Linear Time},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {on},
pages = {STOC19--128--STOC19--155},
year = {2019},
url = {https://doi.org/10.1137/20m1312149},
doi = {10.1137/20M1312149},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BernsteinGW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BernsteinDDKMS19,
author = {Aaron Bernstein and
Karl D{\"{a}}ubel and
Yann Disser and
Max Klimm and
Torsten M{\"{u}}tze and
Frieder Smolny},
title = {Distance-Preserving Graph Contractions},
journal = {{SIAM} J. Discret. Math.},
volume = {33},
number = {3},
pages = {1607--1636},
year = {2019},
url = {https://doi.org/10.1137/18M1169382},
doi = {10.1137/18M1169382},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BernsteinDDKMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiB19,
author = {Sepehr Assadi and
Aaron Bernstein},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Towards a Unified Theory of Sparsification for Matching Problems},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, San Diego,
CA, USA, January 8-9, 2019},
series = {OASIcs},
volume = {69},
pages = {11:1--11:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.11},
doi = {10.4230/OASICS.SOSA.2019.11},
timestamp = {Fri, 28 Nov 2025 09:56:46 +0100},
biburl = {https://dblp.org/rec/conf/soda/AssadiB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiBBMS19,
author = {Sepehr Assadi and
MohammadHossein Bateni and
Aaron Bernstein and
Vahab S. Mirrokni and
Cliff Stein},
editor = {Timothy M. Chan},
title = {Coresets Meet {EDCS:} Algorithms for Matching and Vertex Cover on
Massive Graphs},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1616--1635},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.98},
doi = {10.1137/1.9781611975482.98},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/AssadiBBMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernsteinFH19,
author = {Aaron Bernstein and
Sebastian Forster and
Monika Henzinger},
editor = {Timothy M. Chan},
title = {A Deamortization Approach for Dynamic Spanner and Dynamic Maximal
Matching},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1899--1918},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.115},
doi = {10.1137/1.9781611975482.115},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BernsteinFH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BernsteinN19,
author = {Aaron Bernstein and
Danupon Nanongkai},
editor = {Moses Charikar and
Edith Cohen},
title = {Distributed exact weighted all-pairs shortest paths in near-linear
time},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {334--342},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316326},
doi = {10.1145/3313276.3316326},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BernsteinN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BernsteinPW19,
author = {Aaron Bernstein and
Maximilian Probst and
Christian Wulff{-}Nilsen},
editor = {Moses Charikar and
Edith Cohen},
title = {Decremental strongly-connected components and single-source reachability
in near-linear time},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {365--376},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316335},
doi = {10.1145/3313276.3316335},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BernsteinPW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-03615,
author = {Aaron Bernstein and
Maximilian Probst and
Christian Wulff{-}Nilsen},
title = {Decremental Strongly-Connected Components and Single-Source Reachability
in Near-Linear Time},
journal = {CoRR},
volume = {abs/1901.03615},
year = {2019},
url = {http://arxiv.org/abs/1901.03615},
eprinttype = {arXiv},
eprint = {1901.03615},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-03615.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BernsteinDDKMS18,
author = {Aaron Bernstein and
Karl D{\"{a}}ubel and
Yann Disser and
Max Klimm and
Torsten M{\"{u}}tze and
Frieder Smolny},
editor = {Anna R. Karlin},
title = {Distance-Preserving Graph Contractions},
booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
2018, Cambridge, MA, USA, January 11-14, 2018},
series = {LIPIcs},
volume = {94},
pages = {51:1--51:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.51},
doi = {10.4230/LIPICS.ITCS.2018.51},
timestamp = {Fri, 21 Nov 2025 23:44:11 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BernsteinDDKMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernsteinC18,
author = {Aaron Bernstein and
Shiri Chechik},
editor = {Artur Czumaj},
title = {Incremental Topological Sort and Cycle Detection in Expected Total
Time},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {21--34},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.2},
doi = {10.1137/1.9781611975031.2},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/BernsteinC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernsteinHR18,
author = {Aaron Bernstein and
Jacob Holm and
Eva Rotenberg},
editor = {Artur Czumaj},
title = {Online Bipartite Matching with Amortized Replacements},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {947--959},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.61},
doi = {10.1137/1.9781611975031.61},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BernsteinHR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-10932,
author = {Aaron Bernstein and
Sebastian Forster and
Monika Henzinger},
title = {A Deamortization Approach for Dynamic Spanner and Dynamic Maximal
Matching},
journal = {CoRR},
volume = {abs/1810.10932},
year = {2018},
url = {http://arxiv.org/abs/1810.10932},
eprinttype = {arXiv},
eprint = {1810.10932},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-10932.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-02009,
author = {Sepehr Assadi and
Aaron Bernstein},
title = {Towards a Unified Theory of Sparsification for Matching Problems},
journal = {CoRR},
volume = {abs/1811.02009},
year = {2018},
url = {http://arxiv.org/abs/1811.02009},
eprinttype = {arXiv},
eprint = {1811.02009},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-02009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-03337,
author = {Aaron Bernstein and
Danupon Nanongkai},
title = {Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear
Time},
journal = {CoRR},
volume = {abs/1811.03337},
year = {2018},
url = {http://arxiv.org/abs/1811.03337},
eprinttype = {arXiv},
eprint = {1811.03337},
timestamp = {Fri, 23 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-03337.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BernsteinDG17,
author = {Aaron Bernstein and
Yann Disser and
Martin Gro{\ss}},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {General Bounds for Incremental Maximization},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, Warsaw, Poland, July 10-14, 2017},
series = {LIPIcs},
volume = {80},
pages = {43:1--43:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.43},
doi = {10.4230/LIPICS.ICALP.2017.43},
timestamp = {Fri, 21 Nov 2025 23:44:11 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BernsteinDG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Bernstein17,
author = {Aaron Bernstein},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Deterministic Partially Dynamic Single Source Shortest Paths in Weighted
Graphs},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, Warsaw, Poland, July 10-14, 2017},
series = {LIPIcs},
volume = {80},
pages = {44:1--44:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.44},
doi = {10.4230/LIPICS.ICALP.2017.44},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Bernstein17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BernsteinKPPS17,
author = {Aaron Bernstein and
Tsvi Kopelowitz and
Seth Pettie and
Ely Porat and
Clifford Stein},
editor = {Christos H. Papadimitriou},
title = {Simultaneously Load Balancing for Every p-norm, With Reassignments},
booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS}
2017, Berkeley, CA, USA, January 9-11, 2017},
series = {LIPIcs},
volume = {67},
pages = {51:1--51:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.51},
doi = {10.4230/LIPICS.ITCS.2017.51},
timestamp = {Fri, 21 Nov 2025 23:44:11 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BernsteinKPPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernsteinC17,
author = {Aaron Bernstein and
Shiri Chechik},
editor = {Philip N. Klein},
title = {Deterministic Partially Dynamic Single Source Shortest Paths for Sparse
Graphs},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {453--469},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.29},
doi = {10.1137/1.9781611974782.29},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/BernsteinC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bernstein17a,
author = {Aaron Bernstein},
title = {Deterministic Partially Dynamic Single Source Shortest Paths in Weighted
Graphs},
journal = {CoRR},
volume = {abs/1705.10097},
year = {2017},
url = {http://arxiv.org/abs/1705.10097},
eprinttype = {arXiv},
eprint = {1705.10097},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Bernstein17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BernsteinDG17,
author = {Aaron Bernstein and
Yann Disser and
Martin Gro{\ss}},
title = {General Bounds for Incremental Maximization},
journal = {CoRR},
volume = {abs/1705.10253},
year = {2017},
url = {http://arxiv.org/abs/1705.10253},
eprinttype = {arXiv},
eprint = {1705.10253},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BernsteinDG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BernsteinHR17,
author = {Aaron Bernstein and
Jacob Holm and
Eva Rotenberg},
title = {Online bipartite matching with amortized {\textdollar}O({\textbackslash}log{\^{}}2
n){\textdollar} replacements},
journal = {CoRR},
volume = {abs/1707.06063},
year = {2017},
url = {http://arxiv.org/abs/1707.06063},
eprinttype = {arXiv},
eprint = {1707.06063},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BernsteinHR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-03076,
author = {Sepehr Assadi and
MohammadHossein Bateni and
Aaron Bernstein and
Vahab S. Mirrokni and
Cliff Stein},
title = {Coresets Meet {EDCS:} Algorithms for Matching and Vertex Cover on
Massive Graphs},
journal = {CoRR},
volume = {abs/1711.03076},
year = {2017},
url = {http://arxiv.org/abs/1711.03076},
eprinttype = {arXiv},
eprint = {1711.03076},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-03076.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Bernstein16,
author = {Aaron Bernstein},
title = {Dynamic Algorithms for Shortest Paths and Matching},
school = {Columbia University, {USA}},
year = {2016},
url = {https://doi.org/10.7916/D8QF8T2W},
doi = {10.7916/D8QF8T2W},
timestamp = {Fri, 15 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Bernstein16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bernstein16,
author = {Aaron Bernstein},
title = {Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {2},
pages = {548--574},
year = {2016},
url = {https://doi.org/10.1137/130938670},
doi = {10.1137/130938670},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bernstein16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernsteinS16,
author = {Aaron Bernstein and
Cliff Stein},
editor = {Robert Krauthgamer},
title = {Faster Fully Dynamic Matchings with Small Approximation Ratios},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {692--711},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch50},
doi = {10.1137/1.9781611974331.CH50},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/BernsteinS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BernsteinC16,
author = {Aaron Bernstein and
Shiri Chechik},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Deterministic decremental single source shortest paths: beyond the
o(mn) bound},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {389--397},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897521},
doi = {10.1145/2897518.2897521},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BernsteinC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Bernstein16,
author = {Aaron Bernstein},
title = {Decremental Approximate-APSP in Directed Graphs},
booktitle = {Encyclopedia of Algorithms},
pages = {509--512},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_564},
doi = {10.1007/978-1-4939-2864-4\_564},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Bernstein16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Bernstein16a,
author = {Aaron Bernstein},
title = {Dynamic Approximate-APSP},
booktitle = {Encyclopedia of Algorithms},
pages = {602--605},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_563},
doi = {10.1007/978-1-4939-2864-4\_563},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Bernstein16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BernsteinS15,
author = {Aaron Bernstein and
Cliff Stein},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Fully Dynamic Matching in Bipartite Graphs},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {167--179},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_14},
doi = {10.1007/978-3-662-47672-7\_14},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BernsteinS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BernsteinS15,
author = {Aaron Bernstein and
Clifford Stein},
title = {Fully Dynamic Matching in Bipartite Graphs},
journal = {CoRR},
volume = {abs/1506.07076},
year = {2015},
url = {http://arxiv.org/abs/1506.07076},
eprinttype = {arXiv},
eprint = {1506.07076},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BernsteinS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bernstein13,
author = {Aaron Bernstein},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Maintaining shortest paths under deletions in weighted directed graphs:
[extended abstract]},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {725--734},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488701},
doi = {10.1145/2488608.2488701},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bernstein13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bernstein12,
author = {Aaron Bernstein},
editor = {Yuval Rabani},
title = {Near linear time {(1} + {\(\epsilon\)})-approximation for restricted
shortest paths in undirected graphs},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {189--201},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.17},
doi = {10.1137/1.9781611973099.17},
timestamp = {Tue, 14 Oct 2025 19:39:21 +0200},
biburl = {https://dblp.org/rec/conf/soda/Bernstein12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernsteinR11,
author = {Aaron Bernstein and
Liam Roditty},
editor = {Dana Randall},
title = {Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths
Under Deletions},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {1355--1365},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.104},
doi = {10.1137/1.9781611973082.104},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/BernsteinR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bernstein10,
author = {Aaron Bernstein},
editor = {Moses Charikar},
title = {A Nearly Optimal Algorithm for Approximating Replacement Paths and
k Shortest Simple Paths in General Graphs},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {742--755},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.61},
doi = {10.1137/1.9781611973075.61},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/Bernstein10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Bernstein09,
author = {Aaron Bernstein},
title = {Fully Dynamic {(2} + epsilon) Approximate All-Pairs Shortest Paths
with Fast Query and Close to Linear Update Time},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, Atlanta, Georgia, USA, October 25-27, 2009},
pages = {693--702},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.16},
doi = {10.1109/FOCS.2009.16},
timestamp = {Tue, 08 Jul 2025 16:36:22 +0200},
biburl = {https://dblp.org/rec/conf/focs/Bernstein09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BernsteinK09,
author = {Aaron Bernstein and
David R. Karger},
editor = {Michael Mitzenmacher},
title = {A nearly optimal oracle for avoiding failed vertices and edges},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {101--110},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536431},
doi = {10.1145/1536414.1536431},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BernsteinK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernsteinK08,
author = {Aaron Bernstein and
David R. Karger},
editor = {Shang{-}Hua Teng},
title = {Improved distance sensitivity oracles via random sampling},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {34--43},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347087},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BernsteinK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2026-02-20 22:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
