Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Daniel Reichman 0001
@inproceedings{DBLP:conf/soda/SafranRV24,
author = {Itay Safran and
Daniel Reichman and
Paul Valiant},
editor = {David P. Woodruff},
title = {How Many Neurons Does it Take to Approximate the Maximum?},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {3156--3183},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.113},
doi = {10.1137/1.9781611977912.113},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/SafranRV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-06740,
author = {Mason DiCicco and
Vladimir Podolskii and
Daniel Reichman},
title = {Nearest Neighbor Complexity and Boolean Circuits},
journal = {CoRR},
volume = {abs/2402.06740},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.06740},
doi = {10.48550/ARXIV.2402.06740},
eprinttype = {arXiv},
eprint = {2402.06740},
timestamp = {Fri, 16 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-06740.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-07248,
author = {Itay Safran and
Daniel Reichman and
Paul Valiant},
title = {Depth Separations in Neural Networks: Separating the Dimension from
the Accuracy},
journal = {CoRR},
volume = {abs/2402.07248},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.07248},
doi = {10.48550/ARXIV.2402.07248},
eprinttype = {arXiv},
eprint = {2402.07248},
timestamp = {Fri, 16 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-07248.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DiCiccoP024,
author = {Mason DiCicco and
Vladimir Podolskii and
Daniel Reichman},
title = {Nearest Neighbor Complexity and Boolean Circuits},
journal = {Electron. Colloquium Comput. Complex.},
pages = {TR24--025},
year = {2024},
url = {https://eccc.weizmann.ac.il/report/2024/025},
timestamp = {Tue, 05 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/DiCiccoP024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cogsci/ReichmanLBTG23,
author = {Daniel Reichman and
Falk Lieder and
David D. Bourgin and
Nimrod Talmon and
Thomas L. Griffiths},
title = {The Computational Challenges of Means Selection Problems: Network
Structure of Goal Systems Predicts Human Performance},
journal = {Cogn. Sci.},
volume = {47},
number = {8},
year = {2023},
url = {https://doi.org/10.1111/cogs.13330},
doi = {10.1111/COGS.13330},
timestamp = {Sat, 06 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cogsci/ReichmanLBTG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/DiCiccoR23,
author = {Mason DiCicco and
Daniel Reichman},
title = {The Learning and Communication Complexity of Subsequence Containment},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2023,
Taipei, Taiwan, June 25-30, 2023},
pages = {322--327},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ISIT54713.2023.10206473},
doi = {10.1109/ISIT54713.2023.10206473},
timestamp = {Mon, 28 Aug 2023 17:20:14 +0200},
biburl = {https://dblp.org/rec/conf/isit/DiCiccoR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-12303,
author = {Mason DiCicco and
Henry Poskanzer and
Daniel Reichman},
title = {Inoculation strategies for bounded degree graphs},
journal = {CoRR},
volume = {abs/2304.12303},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.12303},
doi = {10.48550/ARXIV.2304.12303},
eprinttype = {arXiv},
eprint = {2304.12303},
timestamp = {Wed, 03 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-12303.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-09212,
author = {Itay Safran and
Daniel Reichman and
Paul Valiant},
title = {How Many Neurons Does it Take to Approximate the Maximum?},
journal = {CoRR},
volume = {abs/2307.09212},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.09212},
doi = {10.48550/ARXIV.2307.09212},
eprinttype = {arXiv},
eprint = {2307.09212},
timestamp = {Tue, 08 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-09212.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-13554,
author = {Zongchen Chen and
Dan Mikulincer and
Daniel Reichman and
Alexander S. Wein},
title = {Time Lower Bounds for the Metropolis Process and Simulated Annealing},
journal = {CoRR},
volume = {abs/2312.13554},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.13554},
doi = {10.48550/ARXIV.2312.13554},
eprinttype = {arXiv},
eprint = {2312.13554},
timestamp = {Wed, 17 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-13554.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MehtaR22,
author = {Hermish Mehta and
Daniel Reichman},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Local Treewidth of Random and Noisy Graphs with Applications to Stopping
Contagion in Networks},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {7:1--7:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.7},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.7},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/MehtaR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/Mikulincer022,
author = {Dan Mikulincer and
Daniel Reichman},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Size and depth of monotone neural networks: interpolation and approximation},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/24c523085d10743633f9964e0623dbe0-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/Mikulincer022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-07827,
author = {Hermish Mehta and
Daniel Reichman},
title = {Local treewidth of random and noisy graphs with applications to stopping
contagion in networks},
journal = {CoRR},
volume = {abs/2204.07827},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.07827},
doi = {10.48550/ARXIV.2204.07827},
eprinttype = {arXiv},
eprint = {2204.07827},
timestamp = {Thu, 21 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-07827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-05275,
author = {Dan Mikulincer and
Daniel Reichman},
title = {Size and depth of monotone neural networks: interpolation and approximation},
journal = {CoRR},
volume = {abs/2207.05275},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.05275},
doi = {10.48550/ARXIV.2207.05275},
eprinttype = {arXiv},
eprint = {2207.05275},
timestamp = {Thu, 14 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-05275.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Vardi0PS21,
author = {Gal Vardi and
Daniel Reichman and
Toniann Pitassi and
Ohad Shamir},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Size and Depth Separation in Approximating Benign Functions with Neural
Networks},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {4195--4223},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/vardi21a.html},
timestamp = {Wed, 25 Aug 2021 17:11:16 +0200},
biburl = {https://dblp.org/rec/conf/colt/Vardi0PS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GoelKM021,
author = {Surbhi Goel and
Adam R. Klivans and
Pasin Manurangsi and
Daniel Reichman},
editor = {James R. Lee},
title = {Tight Hardness Results for Training Depth-2 ReLU Networks},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {22:1--22:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.22},
doi = {10.4230/LIPICS.ITCS.2021.22},
timestamp = {Thu, 04 Feb 2021 10:38:38 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GoelKM021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-00314,
author = {Gal Vardi and
Daniel Reichman and
Toniann Pitassi and
Ohad Shamir},
title = {Size and Depth Separation in Approximating Natural Functions with
Neural Networks},
journal = {CoRR},
volume = {abs/2102.00314},
year = {2021},
url = {https://arxiv.org/abs/2102.00314},
eprinttype = {arXiv},
eprint = {2102.00314},
timestamp = {Sat, 13 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-00314.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-13399,
author = {Mason DiCicco and
Daniel Reichman},
title = {The Sketching and Communication Complexity of Subsequence Detection},
journal = {CoRR},
volume = {abs/2112.13399},
year = {2021},
url = {https://arxiv.org/abs/2112.13399},
eprinttype = {arXiv},
eprint = {2112.13399},
timestamp = {Thu, 06 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-13399.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlonCGMRSWK20,
author = {Noga Alon and
Jonathan D. Cohen and
Thomas L. Griffiths and
Pasin Manurangsi and
Daniel Reichman and
Igor Shinkar and
Tal Wagner and
Alexander Y. Ku},
title = {Multitasking Capacity: Hardness Results and Improved Constructions},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {1},
pages = {885--903},
year = {2020},
url = {https://doi.org/10.1137/18M1224672},
doi = {10.1137/18M1224672},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlonCGMRSWK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-13550,
author = {Surbhi Goel and
Adam R. Klivans and
Pasin Manurangsi and
Daniel Reichman},
title = {Tight Hardness Results for Training Depth-2 ReLU Networks},
journal = {CoRR},
volume = {abs/2011.13550},
year = {2020},
url = {https://arxiv.org/abs/2011.13550},
eprinttype = {arXiv},
eprint = {2011.13550},
timestamp = {Tue, 01 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-13550.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BennettRS19,
author = {Huck Bennett and
Daniel Reichman and
Igor Shinkar},
title = {On percolation and -hardness},
journal = {Random Struct. Algorithms},
volume = {54},
number = {2},
pages = {228--257},
year = {2019},
url = {https://doi.org/10.1002/rsa.20772},
doi = {10.1002/RSA.20772},
timestamp = {Wed, 27 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BennettRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GolovnevG0S19,
author = {Alexander Golovnev and
Mika G{\"{o}}{\"{o}}s and
Daniel Reichman and
Igor Shinkar},
editor = {Dimitris Achlioptas and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {String Matching: Communication, Circuits, and Learning},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
Institute of Technology, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {145},
pages = {56:1--56:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.56},
doi = {10.4230/LIPICS.APPROX-RANDOM.2019.56},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GolovnevG0S19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/PetersonB0GR19,
author = {David D. Bourgin and
Joshua C. Peterson and
Daniel Reichman and
Stuart J. Russell and
Thomas L. Griffiths},
editor = {Kamalika Chaudhuri and
Ruslan Salakhutdinov},
title = {Cognitive model priors for predicting human decisions},
booktitle = {Proceedings of the 36th International Conference on Machine Learning,
{ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {97},
pages = {5133--5141},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v97/peterson19a.html},
timestamp = {Thu, 28 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/PetersonB0GR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/HalpernP019,
author = {Joseph Y. Halpern and
Rafael Pass and
Daniel Reichman},
editor = {Dimitris Fotakis and
Evangelos Markakis},
title = {On the Existence of Nash Equilibrium in Games with Resource-Bounded
Players},
booktitle = {Algorithmic Game Theory - 12th International Symposium, {SAGT} 2019,
Athens, Greece, September 30 - October 3, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11801},
pages = {139--152},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30473-7\_10},
doi = {10.1007/978-3-030-30473-7\_10},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/HalpernP019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-06866,
author = {Ori Plonsky and
Reut Apel and
Eyal Ert and
Moshe Tennenholtz and
David Bourgin and
Joshua C. Peterson and
Daniel Reichman and
Thomas L. Griffiths and
Stuart J. Russell and
Evan C. Carter and
James F. Cavanagh and
Ido Erev},
title = {Predicting human decisions with behavioral theories and machine learning},
journal = {CoRR},
volume = {abs/1904.06866},
year = {2019},
url = {http://arxiv.org/abs/1904.06866},
eprinttype = {arXiv},
eprint = {1904.06866},
timestamp = {Thu, 28 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-06866.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-09397,
author = {David D. Bourgin and
Joshua C. Peterson and
Daniel Reichman and
Thomas L. Griffiths and
Stuart J. Russell},
title = {Cognitive Model Priors for Predicting Human Decisions},
journal = {CoRR},
volume = {abs/1905.09397},
year = {2019},
url = {http://arxiv.org/abs/1905.09397},
eprinttype = {arXiv},
eprint = {1905.09397},
timestamp = {Thu, 28 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-09397.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FreundPR18,
author = {Daniel Freund and
Matthias Poloczek and
Daniel Reichman},
title = {Contagious sets in dense graphs},
journal = {Eur. J. Comb.},
volume = {68},
pages = {66--78},
year = {2018},
url = {https://doi.org/10.1016/j.ejc.2017.07.011},
doi = {10.1016/J.EJC.2017.07.011},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/FreundPR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/FosterS018,
author = {Dylan J. Foster and
Karthik Sridharan and
Daniel Reichman},
editor = {Amos J. Storkey and
Fernando P{\'{e}}rez{-}Cruz},
title = {Inference in Sparse Graphs with Pairwise Measurements and Side Information},
booktitle = {International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2018, 9-11 April 2018, Playa Blanca, Lanzarote, Canary Islands,
Spain},
series = {Proceedings of Machine Learning Research},
volume = {84},
pages = {1810--1818},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v84/foster18a.html},
timestamp = {Wed, 03 Apr 2019 18:17:22 +0200},
biburl = {https://dblp.org/rec/conf/aistats/FosterS018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-02835,
author = {Noga Alon and
Jonathan D. Cohen and
Thomas L. Griffiths and
Pasin Manurangsi and
Daniel Reichman and
Igor Shinkar and
Tal Wagner and
Alexander Y. Ku},
title = {Multitasking Capacity: Hardness Results and Improved Constructions},
journal = {CoRR},
volume = {abs/1809.02835},
year = {2018},
url = {http://arxiv.org/abs/1809.02835},
eprinttype = {arXiv},
eprint = {1809.02835},
timestamp = {Thu, 28 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-02835.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-04207,
author = {Pasin Manurangsi and
Daniel Reichman},
title = {The Computational Complexity of Training ReLU(s)},
journal = {CoRR},
volume = {abs/1810.04207},
year = {2018},
url = {http://arxiv.org/abs/1810.04207},
eprinttype = {arXiv},
eprint = {1810.04207},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-04207.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcv/KormanRTA17,
author = {Simon Korman and
Daniel Reichman and
Gilad Tsur and
Shai Avidan},
title = {Fast-Match: Fast Affine Template Matching},
journal = {Int. J. Comput. Vis.},
volume = {121},
number = {1},
pages = {111--125},
year = {2017},
url = {https://doi.org/10.1007/s11263-016-0926-1},
doi = {10.1007/S11263-016-0926-1},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijcv/KormanRTA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Montanari0Z17,
author = {Andrea Montanari and
Daniel Reichman and
Ofer Zeitouni},
title = {On the Limitation of Spectral Methods: From the Gaussian Hidden Clique
Problem to Rank One Perturbations of Gaussian Tensors},
journal = {{IEEE} Trans. Inf. Theory},
volume = {63},
number = {3},
pages = {1572--1579},
year = {2017},
url = {https://doi.org/10.1109/TIT.2016.2637959},
doi = {10.1109/TIT.2016.2637959},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Montanari0Z17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cogsci/BourginL0TG17,
author = {David Bourgin and
Falk Lieder and
Daniel Reichman and
Nimrod Talmon and
Tom Griffiths},
editor = {Glenn Gunzelmann and
Andrew Howes and
Thora Tenbrink and
Eddy J. Davelaar},
title = {The Structure of Goal Systems Predicts Human Performance},
booktitle = {Proceedings of the 39th Annual Meeting of the Cognitive Science Society,
CogSci 2017, London, UK, 16-29 July 2017},
publisher = {cognitivesciencesociety.org},
year = {2017},
url = {https://mindmodeling.org/cogsci2017/papers/0324/index.html},
timestamp = {Wed, 17 Apr 2024 12:43:29 +0200},
biburl = {https://dblp.org/rec/conf/cogsci/BourginL0TG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Ben-EliezerK017,
author = {Omri Ben{-}Eliezer and
Simon Korman and
Daniel Reichman},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.9},
doi = {10.4230/LIPICS.ICALP.2017.9},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Ben-EliezerK017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/Alon0SWMCGDO17,
author = {Noga Alon and
Daniel Reichman and
Igor Shinkar and
Tal Wagner and
Sebastian Musslick and
Jonathan D. Cohen and
Tom Griffiths and
Biswadip Dey and
Kayhan {\"{O}}zcimder},
editor = {Isabelle Guyon and
Ulrike von Luxburg and
Samy Bengio and
Hanna M. Wallach and
Rob Fergus and
S. V. N. Vishwanathan and
Roman Garnett},
title = {A graph-theoretic approach to multitasking},
booktitle = {Advances in Neural Information Processing Systems 30: Annual Conference
on Neural Information Processing Systems 2017, December 4-9, 2017,
Long Beach, CA, {USA}},
pages = {2100--2109},
year = {2017},
url = {https://proceedings.neurips.cc/paper/2017/hash/c850371fda6892fbfd1c5a5b457e5777-Abstract.html},
timestamp = {Thu, 28 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/Alon0SWMCGDO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bansal0U17,
author = {Nikhil Bansal and
Daniel Reichman and
Seeun William Umboh},
editor = {Philip N. Klein},
title = {LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth
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 = {1964--1979},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.128},
doi = {10.1137/1.9781611974782.128},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Bansal0U17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FosterRS17,
author = {Dylan J. Foster and
Daniel Reichman and
Karthik Sridharan},
title = {Inference in Sparse Graphs with Pairwise Measurements and Side Information},
journal = {CoRR},
volume = {abs/1703.02728},
year = {2017},
url = {http://arxiv.org/abs/1703.02728},
eprinttype = {arXiv},
eprint = {1703.02728},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FosterRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-02034,
author = {Alexander Golovnev and
Daniel Reichman and
Igor Shinkar},
title = {Detecting Patterns Can Be Hard: Circuit Lower Bounds for the String
Matching Problem},
journal = {CoRR},
volume = {abs/1709.02034},
year = {2017},
url = {http://arxiv.org/abs/1709.02034},
eprinttype = {arXiv},
eprint = {1709.02034},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-02034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FeigeHR16,
author = {Uriel Feige and
Jonathan Hermon and
Daniel Reichman},
title = {On giant components and treewidth in the layers model},
journal = {Random Struct. Algorithms},
volume = {48},
number = {3},
pages = {524--545},
year = {2016},
url = {https://doi.org/10.1002/rsa.20597},
doi = {10.1002/RSA.20597},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FeigeHR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BennettRS16,
author = {Huck Bennett and
Daniel Reichman and
Igor Shinkar},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {On Percolation and NP-Hardness},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {80:1--80:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.80},
doi = {10.4230/LIPICS.ICALP.2016.80},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BennettRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BansalRU16,
author = {Nikhil Bansal and
Daniel Reichman and
Seeun William Umboh},
title = {Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs},
journal = {CoRR},
volume = {abs/1606.05198},
year = {2016},
url = {http://arxiv.org/abs/1606.05198},
eprinttype = {arXiv},
eprint = {1606.05198},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BansalRU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KormanR16a,
author = {Simon Korman and
Daniel Reichman},
title = {Testing Pattern-Freeness},
journal = {CoRR},
volume = {abs/1607.03961},
year = {2016},
url = {http://arxiv.org/abs/1607.03961},
eprinttype = {arXiv},
eprint = {1607.03961},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KormanR16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CohenDGMORSW16,
author = {Jonathan D. Cohen and
Biswadip Dey and
Tom Griffiths and
Sebastian Musslick and
Kayhan {\"{O}}zcimder and
Daniel Reichman and
Igor Shinkar and
Tal Wagner},
title = {A Graph-Theoretic Approach to Multitasking},
journal = {CoRR},
volume = {abs/1611.02400},
year = {2016},
url = {http://arxiv.org/abs/1611.02400},
eprinttype = {arXiv},
eprint = {1611.02400},
timestamp = {Thu, 28 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CohenDGMORSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FeigeR15,
author = {Uriel Feige and
Daniel Reichman},
title = {Recoverable values for independent sets},
journal = {Random Struct. Algorithms},
volume = {46},
number = {1},
pages = {142--159},
year = {2015},
url = {https://doi.org/10.1002/rsa.20492},
doi = {10.1002/RSA.20492},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FeigeR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KrivelevichRS15,
author = {Michael Krivelevich and
Daniel Reichman and
Wojciech Samotij},
title = {Smoothed Analysis on Connected Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {3},
pages = {1654--1669},
year = {2015},
url = {https://doi.org/10.1137/151002496},
doi = {10.1137/151002496},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KrivelevichRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/0001PR15,
author = {Daniel Freund and
Matthias Poloczek and
Daniel Reichman},
editor = {Zsuzsanna Lipt{\'{a}}k and
William F. Smyth},
title = {Contagious Sets in Dense Graphs},
booktitle = {Combinatorial Algorithms - 26th International Workshop, {IWOCA} 2015,
Verona, Italy, October 5-7, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9538},
pages = {185--196},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-29516-9\_16},
doi = {10.1007/978-3-319-29516-9\_16},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/0001PR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/MontanariRZ15,
author = {Andrea Montanari and
Daniel Reichman and
Ofer Zeitouni},
editor = {Corinna Cortes and
Neil D. Lawrence and
Daniel D. Lee and
Masashi Sugiyama and
Roman Garnett},
title = {On the Limitation of Spectral Methods: From the Gaussian Hidden Clique
Problem to Rank-One Perturbations of Gaussian Tensors},
booktitle = {Advances in Neural Information Processing Systems 28: Annual Conference
on Neural Information Processing Systems 2015, December 7-12, 2015,
Montreal, Quebec, Canada},
pages = {217--225},
year = {2015},
url = {https://proceedings.neurips.cc/paper/2015/hash/c9e1074f5b3f9fc8ea15d152add07294-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/MontanariRZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Coja-OghlanFKR15,
author = {Amin Coja{-}Oghlan and
Uriel Feige and
Michael Krivelevich and
Daniel Reichman},
editor = {Piotr Indyk},
title = {Contagious Sets in Expanders},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1953--1987},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.131},
doi = {10.1137/1.9781611973730.131},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/Coja-OghlanFKR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FreundPR15,
author = {Daniel Freund and
Matthias Poloczek and
Daniel Reichman},
title = {Contagious Sets in Dense Graphs},
journal = {CoRR},
volume = {abs/1503.00158},
year = {2015},
url = {http://arxiv.org/abs/1503.00158},
eprinttype = {arXiv},
eprint = {1503.00158},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FreundPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HalpernPR15,
author = {Joseph Y. Halpern and
Rafael Pass and
Daniel Reichman},
title = {On the Non-Existence of Nash Equilibrium in Games with Resource-Bounded
Players},
journal = {CoRR},
volume = {abs/1507.01501},
year = {2015},
url = {http://arxiv.org/abs/1507.01501},
eprinttype = {arXiv},
eprint = {1507.01501},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HalpernPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ReichmanS15,
author = {Daniel Reichman and
Igor Shinkar},
title = {On Percolation and NP-Hardness},
journal = {CoRR},
volume = {abs/1508.02071},
year = {2015},
url = {http://arxiv.org/abs/1508.02071},
eprinttype = {arXiv},
eprint = {1508.02071},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ReichmanS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ReichmanS15,
author = {Daniel Reichman and
Igor Shinkar},
title = {On Percolation and NP-Hardness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-132}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/132},
eprinttype = {ECCC},
eprint = {TR15-132},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ReichmanS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KrivelevichRS14,
author = {Michael Krivelevich and
Daniel Reichman and
Wojciech Samotij},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {Smoothed Analysis on Connected Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {810--825},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.810},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.810},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/KrivelevichRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeigeHR14,
author = {Uriel Feige and
Jonathan Hermon and
Daniel Reichman},
title = {On giant components and treewidth in the layers model},
journal = {CoRR},
volume = {abs/1401.6681},
year = {2014},
url = {http://arxiv.org/abs/1401.6681},
eprinttype = {arXiv},
eprint = {1401.6681},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeigeHR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MontanariRZ14,
author = {Andrea Montanari and
Daniel Reichman and
Ofer Zeitouni},
title = {On the limitation of spectral methods: From the Gaussian hidden clique
problem to rank one perturbations of Gaussian tensors},
journal = {CoRR},
volume = {abs/1411.6149},
year = {2014},
url = {http://arxiv.org/abs/1411.6149},
eprinttype = {arXiv},
eprint = {1411.6149},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MontanariRZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cvpr/KormanRTA13,
author = {Simon Korman and
Daniel Reichman and
Gilad Tsur and
Shai Avidan},
title = {FasT-Match: Fast Affine Template Matching},
booktitle = {2013 {IEEE} Conference on Computer Vision and Pattern Recognition,
Portland, OR, USA, June 23-28, 2013},
pages = {2331--2338},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CVPR.2013.302},
doi = {10.1109/CVPR.2013.302},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cvpr/KormanRTA13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Coja-OghlanFKR13,
author = {Amin Coja{-}Oghlan and
Uriel Feige and
Michael Krivelevich and
Daniel Reichman},
title = {Contagious Sets in Expanders},
journal = {CoRR},
volume = {abs/1306.2465},
year = {2013},
url = {http://arxiv.org/abs/1306.2465},
eprinttype = {arXiv},
eprint = {1306.2465},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Coja-OghlanFKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Reichman12,
author = {Daniel Reichman},
title = {New bounds for contagious sets},
journal = {Discret. Math.},
volume = {312},
number = {10},
pages = {1812--1814},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2012.01.016},
doi = {10.1016/J.DISC.2012.01.016},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Reichman12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FeigeR11,
author = {Uriel Feige and
Daniel Reichman},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Recoverable Values for Independent Sets},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {486--497},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_41},
doi = {10.1007/978-3-642-22006-7\_41},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FeigeR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-5609,
author = {Uriel Feige and
Daniel Reichman},
title = {Recoverable Values for Independent Sets},
journal = {CoRR},
volume = {abs/1103.5609},
year = {2011},
url = {http://arxiv.org/abs/1103.5609},
eprinttype = {arXiv},
eprint = {1103.5609},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-5609.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-1713,
author = {Simon Korman and
Daniel Reichman and
Gilad Tsur},
title = {Tight Approximation of Image Matching},
journal = {CoRR},
volume = {abs/1111.1713},
year = {2011},
url = {http://arxiv.org/abs/1111.1713},
eprinttype = {arXiv},
eprint = {1111.1713},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-1713.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-3619,
author = {Daniel Reichman},
title = {Influence is a Matter of Degree: New Algorithms for Activation Problems},
journal = {CoRR},
volume = {abs/1009.3619},
year = {2010},
url = {http://arxiv.org/abs/1009.3619},
eprinttype = {arXiv},
eprint = {1009.3619},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-3619.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NutovR08,
author = {Zeev Nutov and
Daniel Reichman},
title = {Approximating maximum satisfiable subsystems of linear equations of
bounded width},
journal = {Inf. Process. Lett.},
volume = {106},
number = {5},
pages = {203--207},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2007.11.011},
doi = {10.1016/J.IPL.2007.11.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NutovR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FeigeR06,
author = {Uriel Feige and
Daniel Reichman},
title = {On the hardness of approximating Max-Satisfy},
journal = {Inf. Process. Lett.},
volume = {97},
number = {1},
pages = {31--35},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.08.012},
doi = {10.1016/J.IPL.2005.08.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FeigeR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeR04,
author = {Uriel Feige and
Daniel Reichman},
editor = {Klaus Jansen and
Sanjeev Khanna and
Jos{\'{e}} D. P. Rolim and
Dana Ron},
title = {On Systems of Linear Equations with Two Variables per Equation},
booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms
and Techniques, 7th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International
Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge,
MA, USA, August 22-24, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3122},
pages = {117--127},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27821-4\_11},
doi = {10.1007/978-3-540-27821-4\_11},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/FeigeR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-119,
author = {Uriel Feige and
Daniel Reichman},
title = {On The Hardness of Approximating Max-Satisfy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-119}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-119/index.html},
eprinttype = {ECCC},
eprint = {TR04-119},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-119.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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 2024-04-18 22:57 CEST 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:
