default search action

combined dblp search
author search
venue search
publication search

ask others

BibTeX records: Amir M. Ben-Amram

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Persons > Amir M. Ben-Amram

download as .bib file

@article{DBLP:journals/jla/BenAmramK25,
  author       = {Amir M. Ben{-}Amram and
                  Lars Kristiansen},
  title        = {A degree structure on representations of irrational numbers},
  journal      = {J. Log. Anal.},
  volume       = {17},
  year         = {2025},
  url          = {http://logicandanalysis.org/index.php/jla/article/view/502},
  timestamp    = {Tue, 04 Mar 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jla/BenAmramK25.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2509-06752,
  author       = {Amir M. Ben{-}Amram and
                  Samir Genaim and
                  Jo{\"{e}}l Ouaknine and
                  James Worrell},
  title        = {Termination Analysis of Linear-Constraint Programs},
  journal      = {CoRR},
  volume       = {abs/2509.06752},
  year         = {2025},
  url          = {https://doi.org/10.48550/arXiv.2509.06752},
  doi          = {10.48550/ARXIV.2509.06752},
  eprinttype    = {arXiv},
  eprint       = {2509.06752},
  timestamp    = {Sun, 12 Oct 2025 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2509-06752.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2304-07227,
  author       = {Amir M. Ben{-}Amram and
                  Lars Kristiansen and
                  Jakob Grue Simonsen},
  title        = {On representations of real numbers and the computational complexity
                  of converting between such representations},
  journal      = {CoRR},
  volume       = {abs/2304.07227},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2304.07227},
  doi          = {10.48550/ARXIV.2304.07227},
  eprinttype    = {arXiv},
  eprint       = {2304.07227},
  timestamp    = {Thu, 20 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2304-07227.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/lmcs/Ben-AmramH21,
  author       = {Amir M. Ben{-}Amram and
                  Geoff W. Hamilton},
  title        = {Tight Polynomial Bounds for Loop Programs in Polynomial Space},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {17},
  number       = {4},
  year         = {2021},
  url          = {https://doi.org/10.46298/lmcs-17(4:7)2021},
  doi          = {10.46298/LMCS-17(4:7)2021},
  timestamp    = {Tue, 24 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lmcs/Ben-AmramH21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/lmcs/Ben-AmramH20,
  author       = {Amir M. Ben{-}Amram and
                  Geoff W. Hamilton},
  title        = {Tight Polynomial Worst-Case Bounds for Loop Programs},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {16},
  number       = {2},
  year         = {2020},
  url          = {https://doi.org/10.23638/LMCS-16(2:4)2020},
  doi          = {10.23638/LMCS-16(2:4)2020},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/lmcs/Ben-AmramH20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2010-02823,
  author       = {Amir M. Ben{-}Amram and
                  Geoff W. Hamilton},
  title        = {Tight Polynomial Bounds for Loop Programs in Polynomial Space},
  journal      = {CoRR},
  volume       = {abs/2010.02823},
  year         = {2020},
  url          = {https://arxiv.org/abs/2010.02823},
  eprinttype    = {arXiv},
  eprint       = {2010.02823},
  timestamp    = {Tue, 13 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2010-02823.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fossacs/Ben-AmramH19,
  author       = {Amir M. Ben{-}Amram and
                  Geoff W. Hamilton},
  title        = {Tight Worst-Case Bounds for Polynomial Loop Programs},
  booktitle    = {Foundations of Software Science and Computation Structures - 22nd
                  International Conference, {FOSSACS} 2019, Held as Part of the European
                  Joint Conferences on Theory and Practice of Software, {ETAPS} 2019,
                  Prague, Czech Republic, April 6-11, 2019, Proceedings},
  pages        = {80--97},
  year         = {2019},
  crossref     = {DBLP:conf/fossacs/2019},
  url          = {https://doi.org/10.1007/978-3-030-17127-8\_5},
  doi          = {10.1007/978-3-030-17127-8\_5},
  timestamp    = {Fri, 31 Jan 2020 21:32:20 +0100},
  biburl       = {https://dblp.org/rec/conf/fossacs/Ben-AmramH19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sas/Ben-AmramDG19,
  author       = {Amir M. Ben{-}Amram and
                  Jes{\'{u}}s J. Dom{\'{e}}nech and
                  Samir Genaim},
  title        = {Multiphase-Linear Ranking Functions and Their Relation to Recurrent
                  Sets},
  booktitle    = {Static Analysis - 26th International Symposium, {SAS} 2019, Porto,
                  Portugal, October 8-11, 2019, Proceedings},
  pages        = {459--480},
  year         = {2019},
  crossref     = {DBLP:conf/sas/2019},
  url          = {https://doi.org/10.1007/978-3-030-32304-2\_22},
  doi          = {10.1007/978-3-030-32304-2\_22},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sas/Ben-AmramDG19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1906-10047,
  author       = {Amir M. Ben{-}Amram and
                  Geoff W. Hamilton},
  title        = {Tight Polynomial Worst-Case Bounds for Loop Programs},
  journal      = {CoRR},
  volume       = {abs/1906.10047},
  year         = {2019},
  url          = {http://arxiv.org/abs/1906.10047},
  eprinttype    = {arXiv},
  eprint       = {1906.10047},
  timestamp    = {Thu, 27 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1906-10047.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1811-07340,
  author       = {Amir M. Ben{-}Amram and
                  Jes{\'{u}}s Dom{\'{e}}nech and
                  Samir Genaim},
  title        = {Multiphase-Linear Ranking Functions and their Relation to Recurrent
                  Sets},
  journal      = {CoRR},
  volume       = {abs/1811.07340},
  year         = {2018},
  url          = {http://arxiv.org/abs/1811.07340},
  eprinttype    = {arXiv},
  eprint       = {1811.07340},
  timestamp    = {Sun, 25 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1811-07340.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cav/Ben-AmramG17,
  author       = {Amir M. Ben{-}Amram and
                  Samir Genaim},
  title        = {On Multiphase-Linear Ranking Functions},
  booktitle    = {Computer Aided Verification - 29th International Conference, {CAV}
                  2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part {II}},
  pages        = {601--620},
  year         = {2017},
  crossref     = {DBLP:conf/cav/2017-2},
  url          = {https://doi.org/10.1007/978-3-319-63390-9\_32},
  doi          = {10.1007/978-3-319-63390-9\_32},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cav/Ben-AmramG17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Ben-AmramG17,
  author       = {Amir M. Ben{-}Amram and
                  Samir Genaim},
  title        = {On Multiphase-Linear Ranking Functions},
  journal      = {CoRR},
  volume       = {abs/1703.07547},
  year         = {2017},
  url          = {http://arxiv.org/abs/1703.07547},
  eprinttype    = {arXiv},
  eprint       = {1703.07547},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Ben-AmramG17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:journals/corr/Ben-AmramP14,
  author       = {Amir M. Ben{-}Amram and
                  Aviad Pineles},
  title        = {Flowchart Programs, Regular Expressions, and Decidability of Polynomial
                  Growth-Rate},
  booktitle    = {Proceedings of the Fourth International Workshop on Verification and
                  Program Transformation, VPT@ETAPS 2016, Eindhoven, The Netherlands,
                  2nd April 2016},
  pages        = {24--49},
  year         = {2016},
  crossref     = {DBLP:journals/corr/HamiltonLN16},
  url          = {https://doi.org/10.4204/EPTCS.216.2},
  doi          = {10.4204/EPTCS.216.2},
  timestamp    = {Fri, 03 Jun 2022 08:18:12 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Ben-AmramP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/computability/Ben-Amram15,
  author       = {Amir M. Ben{-}Amram},
  title        = {Mortality of iterated piecewise affine functions over the integers:
                  Decidability and complexity},
  journal      = {Comput.},
  volume       = {4},
  number       = {1},
  pages        = {19--56},
  year         = {2015},
  url          = {https://doi.org/10.3233/COM-150032},
  doi          = {10.3233/COM-150032},
  timestamp    = {Thu, 24 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/computability/Ben-Amram15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cav/Ben-AmramG15,
  author       = {Amir M. Ben{-}Amram and
                  Samir Genaim},
  title        = {Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions},
  booktitle    = {Computer Aided Verification - 27th International Conference, {CAV}
                  2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part
                  {II}},
  pages        = {304--321},
  year         = {2015},
  crossref     = {DBLP:conf/cav/2015},
  url          = {https://doi.org/10.1007/978-3-319-21668-3\_18},
  doi          = {10.1007/978-3-319-21668-3\_18},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cav/Ben-AmramG15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Ben-AmramG15,
  author       = {Amir M. Ben{-}Amram and
                  Samir Genaim},
  title        = {Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions},
  journal      = {CoRR},
  volume       = {abs/1504.05018},
  year         = {2015},
  url          = {http://arxiv.org/abs/1504.05018},
  eprinttype    = {arXiv},
  eprint       = {1504.05018},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Ben-AmramG15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Ben-AmramG14,
  author       = {Amir M. Ben{-}Amram and
                  Samir Genaim},
  title        = {Ranking Functions for Linear-Constraint Loops},
  journal      = {J. {ACM}},
  volume       = {61},
  number       = {4},
  pages        = {26:1--26:55},
  year         = {2014},
  url          = {https://doi.org/10.1145/2629488},
  doi          = {10.1145/2629488},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Ben-AmramG14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:journals/corr/Ben-Amram14,
  author       = {Amir M. Ben{-}Amram},
  title        = {The Hardness of Finding Linear Ranking Functions for Lasso Programs},
  booktitle    = {Proceedings Fifth International Symposium on Games, Automata, Logics
                  and Formal Verification, GandALF 2014, Verona, Italy, September 10-12,
                  2014},
  pages        = {32--45},
  year         = {2014},
  crossref     = {DBLP:journals/corr/PeronP14},
  url          = {https://doi.org/10.4204/EPTCS.161.6},
  doi          = {10.4204/EPTCS.161.6},
  timestamp    = {Wed, 12 Sep 2018 01:05:14 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Ben-Amram14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cav/Ben-Amram13,
  author       = {Amir M. Ben{-}Amram},
  title        = {Ranking Functions for Linear-Constraint Loops},
  booktitle    = {First International Workshop on Verification and Program Transformation,
                  {VPT} 2013, Saint Petersburg, Russia, July 12-13, 2013},
  pages        = {1--8},
  year         = {2013},
  crossref     = {DBLP:conf/cav/2013vpt},
  url          = {https://doi.org/10.29007/rvs4},
  doi          = {10.29007/RVS4},
  timestamp    = {Fri, 03 Jun 2022 08:18:13 +0200},
  biburl       = {https://dblp.org/rec/conf/cav/Ben-Amram13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/popl/Ben-AmramG13,
  author       = {Amir M. Ben{-}Amram and
                  Samir Genaim},
  title        = {On the linear ranking problem for integer linear-constraint loops},
  booktitle    = {The 40th Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of
                  Programming Languages, {POPL} '13, Rome, Italy - January 23 - 25,
                  2013},
  pages        = {51--62},
  year         = {2013},
  crossref     = {DBLP:conf/popl/2013},
  url          = {https://doi.org/10.1145/2429069.2429078},
  doi          = {10.1145/2429069.2429078},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/popl/Ben-AmramG13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Ben-Amram13,
  author       = {Amir M. Ben{-}Amram},
  title        = {Mortality of Iterated Piecewise Affine Functions over the Integers:
                  Decidability and Complexity (extended abstract)},
  booktitle    = {30th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
  pages        = {514--525},
  year         = {2013},
  crossref     = {DBLP:conf/stacs/2013},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2013.514},
  doi          = {10.4230/LIPICS.STACS.2013.514},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Ben-Amram13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1305-0911,
  author       = {Amir M. Ben{-}Amram},
  title        = {A Comment on Budach's Mouse-in-an-Octant Problem},
  journal      = {CoRR},
  volume       = {abs/1305.0911},
  year         = {2013},
  url          = {http://arxiv.org/abs/1305.0911},
  eprinttype    = {arXiv},
  eprint       = {1305.0911},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1305-0911.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cjtcs/Ben-AmramCS12,
  author       = {Amir M. Ben{-}Amram and
                  Niels H. Christensen and
                  Jakob Grue Simonsen},
  title        = {Computational Models with No Linear Speedup},
  journal      = {Chic. J. Theor. Comput. Sci.},
  volume       = {2012},
  year         = {2012},
  url          = {http://cjtcs.cs.uchicago.edu/articles/2012/7/contents.html},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cjtcs/Ben-AmramCS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/Ben-AmramK12,
  author       = {Amir M. Ben{-}Amram and
                  Lars Kristiansen},
  title        = {On the Edge of Decidability in Complexity Analysis of Loop Programs},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {23},
  number       = {7},
  pages        = {1451--1464},
  year         = {2012},
  url          = {https://doi.org/10.1142/S0129054112400588},
  doi          = {10.1142/S0129054112400588},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/Ben-AmramK12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/logcom/Ben-AmramLO12,
  author       = {Amir M. Ben{-}Amram and
                  Bruno Loff and
                  Isabel Oitavem},
  title        = {Monotonicity Constraints in Characterizations of {PSPACE}},
  journal      = {J. Log. Comput.},
  volume       = {22},
  number       = {2},
  pages        = {179--195},
  year         = {2012},
  url          = {https://doi.org/10.1093/logcom/exq002},
  doi          = {10.1093/LOGCOM/EXQ002},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/logcom/Ben-AmramLO12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Ben-AmramY12,
  author       = {Amir M. Ben{-}Amram and
                  Simon Yoffe},
  title        = {Corrigendum to "A simple and efficient Union-Find-Delete algorithm"
                  [Theoret. Comput. Sci. 412(4-5) 487-492]},
  journal      = {Theor. Comput. Sci.},
  volume       = {423},
  pages        = {75},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2011.12.074},
  doi          = {10.1016/J.TCS.2011.12.074},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ben-AmramY12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toplas/Ben-AmramGM12,
  author       = {Amir M. Ben{-}Amram and
                  Samir Genaim and
                  Abu Naser Masud},
  title        = {On the Termination of Integer Loops},
  journal      = {{ACM} Trans. Program. Lang. Syst.},
  volume       = {34},
  number       = {4},
  pages        = {16:1--16:24},
  year         = {2012},
  url          = {https://doi.org/10.1145/2400676.2400679},
  doi          = {10.1145/2400676.2400679},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toplas/Ben-AmramGM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/vmcai/Ben-AmramGM12,
  author       = {Amir M. Ben{-}Amram and
                  Samir Genaim and
                  Abu Naser Masud},
  title        = {On the Termination of Integer Loops},
  booktitle    = {Verification, Model Checking, and Abstract Interpretation - 13th International
                  Conference, {VMCAI} 2012, Philadelphia, PA, USA, January 22-24, 2012.
                  Proceedings},
  pages        = {72--87},
  year         = {2012},
  crossref     = {DBLP:conf/vmcai/2012},
  url          = {https://doi.org/10.1007/978-3-642-27940-9\_6},
  doi          = {10.1007/978-3-642-27940-9\_6},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/vmcai/Ben-AmramGM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1202-4281,
  author       = {Amir M. Ben{-}Amram and
                  Michael Vainer},
  title        = {Bounded Termination of Monotonicity-Constraint Transition Systems},
  journal      = {CoRR},
  volume       = {abs/1202.4281},
  year         = {2012},
  url          = {http://arxiv.org/abs/1202.4281},
  eprinttype    = {arXiv},
  eprint       = {1202.4281},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1202-4281.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1208-4041,
  author       = {Amir M. Ben{-}Amram and
                  Samir Genaim},
  title        = {On the Linear Ranking Problem for Integer Linear-Constraint Loops},
  journal      = {CoRR},
  volume       = {abs/1208.4041},
  year         = {2012},
  url          = {http://arxiv.org/abs/1208.4041},
  eprinttype    = {arXiv},
  eprint       = {1208.4041},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1208-4041.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1105-6317,
  author       = {Amir M. Ben{-}Amram},
  title        = {Monotonicity Constraints for Termination in the Integer Domain},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {7},
  number       = {3},
  year         = {2011},
  url          = {https://doi.org/10.2168/LMCS-7(3:4)2011},
  doi          = {10.2168/LMCS-7(3:4)2011},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1105-6317.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Ben-AmramY11,
  author       = {Amir M. Ben{-}Amram and
                  Simon Yoffe},
  title        = {A simple and efficient Union-Find-Delete algorithm},
  journal      = {Theor. Comput. Sci.},
  volume       = {412},
  number       = {4-5},
  pages        = {487--492},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.tcs.2010.11.005},
  doi          = {10.1016/J.TCS.2010.11.005},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ben-AmramY11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tplp/CodishGBFG11,
  author       = {Michael Codish and
                  Igor Gonopolskiy and
                  Amir M. Ben{-}Amram and
                  Carsten Fuhs and
                  J{\"{u}}rgen Giesl},
  title        = {SAT-based termination analysis using monotonicity constraints over
                  the integers},
  journal      = {Theory Pract. Log. Program.},
  volume       = {11},
  number       = {4-5},
  pages        = {503--520},
  year         = {2011},
  url          = {https://doi.org/10.1017/S1471068411000147},
  doi          = {10.1017/S1471068411000147},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tplp/CodishGBFG11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1107-5980,
  author       = {Michael Codish and
                  Igor Gonopolskiy and
                  Amir M. Ben{-}Amram and
                  Carsten Fuhs and
                  J{\"{u}}rgen Giesl},
  title        = {SAT-Based Termination Analysis Using Monotonicity Constraints over
                  the Integers},
  journal      = {CoRR},
  volume       = {abs/1107.5980},
  year         = {2011},
  url          = {http://arxiv.org/abs/1107.5980},
  eprinttype    = {arXiv},
  eprint       = {1107.5980},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1107-5980.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1005-0253,
  author       = {Amir M. Ben{-}Amram},
  title        = {Size-Change Termination, Monotonicity Constraints and Ranking Functions},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {6},
  number       = {3},
  year         = {2010},
  url          = {http://arxiv.org/abs/1005.0253},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1005-0253.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:journals/corr/abs-1005-0518,
  author       = {Amir M. Ben{-}Amram},
  title        = {On Decidable Growth-Rate Properties of Imperative Programs},
  booktitle    = {Proceedings International Workshop on Developments in Implicit Computational
                  complExity, {DICE} 2010, Paphos, Cyprus, 27-28th March 2010},
  pages        = {1--14},
  year         = {2010},
  crossref     = {DBLP:journals/corr/abs-1005-0653},
  url          = {https://doi.org/10.4204/EPTCS.23.1},
  doi          = {10.4204/EPTCS.23.1},
  timestamp    = {Wed, 12 Sep 2018 01:05:13 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1005-0518.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Ben-Amram09,
  author       = {Amir M. Ben{-}Amram},
  title        = {A complexity tradeoff in ranking-function termination proofs},
  journal      = {Acta Informatica},
  volume       = {46},
  number       = {1},
  pages        = {57--72},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00236-008-0085-0},
  doi          = {10.1007/S00236-008-0085-0},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Ben-Amram09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0903-4382,
  author       = {Amir M. Ben{-}Amram and
                  Chin Soon Lee},
  title        = {Ranking Functions for Size-Change Termination {II}},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {5},
  number       = {2},
  year         = {2009},
  url          = {http://arxiv.org/abs/0903.4382},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0903-4382.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cav/Ben-Amram09,
  author       = {Amir M. Ben{-}Amram},
  title        = {Size-Change Termination, Monotonicity Constraints and Ranking Functions},
  booktitle    = {Computer Aided Verification, 21st International Conference, {CAV}
                  2009, Grenoble, France, June 26 - July 2, 2009. Proceedings},
  pages        = {109--123},
  year         = {2009},
  crossref     = {DBLP:conf/cav/2009},
  url          = {https://doi.org/10.1007/978-3-642-02658-4\_12},
  doi          = {10.1007/978-3-642-02658-4\_12},
  timestamp    = {Tue, 14 May 2019 10:00:43 +0200},
  biburl       = {https://dblp.org/rec/conf/cav/Ben-Amram09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0909-1030,
  author       = {Amir M. Ben{-}Amram},
  title        = {The Euler Path to Static Level-Ancestors},
  journal      = {CoRR},
  volume       = {abs/0909.1030},
  year         = {2009},
  url          = {http://arxiv.org/abs/0909.1030},
  eprinttype    = {arXiv},
  eprint       = {0909.1030},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0909-1030.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toplas/Ben-Amram08,
  author       = {Amir M. Ben{-}Amram},
  title        = {Size-change termination with difference constraints},
  journal      = {{ACM} Trans. Program. Lang. Syst.},
  volume       = {30},
  number       = {3},
  pages        = {16:1--16:31},
  year         = {2008},
  url          = {https://doi.org/10.1145/1353445.1353450},
  doi          = {10.1145/1353445.1353450},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/toplas/Ben-Amram08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cie/Ben-AmramJK08,
  author       = {Amir M. Ben{-}Amram and
                  Neil D. Jones and
                  Lars Kristiansen},
  title        = {Linear, Polynomial or Exponential? Complexity Inference in Polynomial
                  Time},
  booktitle    = {Logic and Theory of Algorithms, 4th Conference on Computability in
                  Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings},
  pages        = {67--76},
  year         = {2008},
  crossref     = {DBLP:conf/cie/2008},
  url          = {https://doi.org/10.1007/978-3-540-69407-6\_7},
  doi          = {10.1007/978-3-540-69407-6\_7},
  timestamp    = {Tue, 14 May 2019 10:00:41 +0200},
  biburl       = {https://dblp.org/rec/conf/cie/Ben-AmramJK08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tacas/Ben-AmramC08,
  author       = {Amir M. Ben{-}Amram and
                  Michael Codish},
  title        = {A SAT-Based Approach to Size Change Termination with Global Ranking
                  Functions},
  booktitle    = {Tools and Algorithms for the Construction and Analysis of Systems,
                  14th International Conference, {TACAS} 2008, Held as Part of the Joint
                  European Conferences on Theory and Practice of Software, {ETAPS} 2008,
                  Budapest, Hungary, March 29-April 6, 2008. Proceedings},
  pages        = {218--232},
  year         = {2008},
  crossref     = {DBLP:conf/tacas/2008},
  url          = {https://doi.org/10.1007/978-3-540-78800-3\_16},
  doi          = {10.1007/978-3-540-78800-3\_16},
  timestamp    = {Mon, 03 Apr 2023 17:23:33 +0200},
  biburl       = {https://dblp.org/rec/conf/tacas/Ben-AmramC08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toplas/Ben-AmramL07,
  author       = {Amir M. Ben{-}Amram and
                  Chin Soon Lee},
  title        = {Program termination analysis in polynomial time},
  journal      = {{ACM} Trans. Program. Lang. Syst.},
  volume       = {29},
  number       = {1},
  pages        = {5:1--5:37},
  year         = {2007},
  url          = {https://doi.org/10.1145/1180475.1180480},
  doi          = {10.1145/1180475.1180480},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/toplas/Ben-AmramL07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Ben-AmramP06,
  author       = {Amir M. Ben{-}Amram and
                  Holger Petersen},
  title        = {Backing up in singly linked lists},
  journal      = {J. {ACM}},
  volume       = {53},
  number       = {4},
  pages        = {681--705},
  year         = {2006},
  url          = {https://doi.org/10.1145/1162349.1162353},
  doi          = {10.1145/1162349.1162353},
  timestamp    = {Fri, 15 Mar 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Ben-AmramP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/sigact/Ben-Amram05,
  author       = {Amir M. Ben{-}Amram},
  title        = {The Church-Turing thesis and its look-alikes},
  journal      = {{SIGACT} News},
  volume       = {36},
  number       = {3},
  pages        = {113--114},
  year         = {2005},
  url          = {https://doi.org/10.1145/1086649.1086651},
  doi          = {10.1145/1086649.1086651},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/sigact/Ben-Amram05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/sigact/Ben-Amram04,
  author       = {Amir M. Ben{-}Amram},
  title        = {A complexity-theoretic proof of a Recursion-Theoretic Theorem},
  journal      = {{SIGACT} News},
  volume       = {35},
  number       = {2},
  pages        = {111--112},
  year         = {2004},
  url          = {https://doi.org/10.1145/992287.992288},
  doi          = {10.1145/992287.992288},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/sigact/Ben-Amram04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Ben-AmramBP03,
  author       = {Amir M. Ben{-}Amram and
                  Omer Berkman and
                  Holger Petersen},
  title        = {Element distinctness on one-tape Turing machines: a complete solution},
  journal      = {Acta Informatica},
  volume       = {40},
  number       = {2},
  pages        = {81--94},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00236-003-0125-8},
  doi          = {10.1007/S00236-003-0125-8},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Ben-AmramBP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Ben-Amram03,
  author       = {Amir M. Ben{-}Amram},
  title        = {Tighter constant-factor time hierarchies},
  journal      = {Inf. Process. Lett.},
  volume       = {87},
  number       = {1},
  pages        = {39--44},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0020-0190(03)00253-9},
  doi          = {10.1016/S0020-0190(03)00253-9},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Ben-Amram03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Ben-AmramG02,
  author       = {Amir M. Ben{-}Amram and
                  Zvi Galil},
  title        = {Lower Bounds for Dynamic Data Structures on Algebraic RAMs},
  journal      = {Algorithmica},
  volume       = {32},
  number       = {3},
  pages        = {364--395},
  year         = {2002},
  url          = {https://doi.org/10.1007/s00453-001-0079-6},
  doi          = {10.1007/S00453-001-0079-6},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Ben-AmramG02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/Ben-AmramP02,
  author       = {Amir M. Ben{-}Amram and
                  Holger Petersen},
  title        = {Improved Bounds for Functions Related to Busy Beavers},
  journal      = {Theory Comput. Syst.},
  volume       = {35},
  number       = {1},
  pages        = {1--11},
  year         = {2002},
  url          = {https://doi.org/10.1007/s00224-001-1052-0},
  doi          = {10.1007/S00224-001-1052-0},
  timestamp    = {Fri, 15 Mar 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/Ben-AmramP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/birthday/Ben-Amram02,
  author       = {Amir M. Ben{-}Amram},
  title        = {General Size-Change Termination and Lexicographic Descent},
  booktitle    = {The Essence of Computation, Complexity, Analysis, Transformation.
                  Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday]},
  pages        = {3--17},
  year         = {2002},
  crossref     = {DBLP:conf/birthday/2002jones},
  url          = {https://doi.org/10.1007/3-540-36377-7\_1},
  doi          = {10.1007/3-540-36377-7\_1},
  timestamp    = {Tue, 14 May 2019 10:00:52 +0200},
  biburl       = {https://dblp.org/rec/conf/birthday/Ben-Amram02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Ben-AmramG01,
  author       = {Amir M. Ben{-}Amram and
                  Zvi Galil},
  title        = {A Generalization of a Lower Bound Technique due to Fredman and Saks},
  journal      = {Algorithmica},
  volume       = {30},
  number       = {1},
  pages        = {34--66},
  year         = {2001},
  url          = {https://doi.org/10.1007/s004530010077},
  doi          = {10.1007/S004530010077},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Ben-AmramG01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Ben-AmramG01,
  author       = {Amir M. Ben{-}Amram and
                  Zvi Galil},
  title        = {Topological Lower Bounds on Algebraic Random Access Machines},
  journal      = {{SIAM} J. Comput.},
  volume       = {31},
  number       = {3},
  pages        = {722--761},
  year         = {2001},
  url          = {https://doi.org/10.1137/S0097539797329397},
  doi          = {10.1137/S0097539797329397},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Ben-AmramG01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/popl/LeeJB01,
  author       = {Chin Soon Lee and
                  Neil D. Jones and
                  Amir M. Ben{-}Amram},
  title        = {The size-change principle for program termination},
  booktitle    = {Conference Record of {POPL} 2001: The 28th {ACM} {SIGPLAN-SIGACT}
                  Symposium on Principles of Programming Languages, London, UK, January
                  17-19, 2001},
  pages        = {81--92},
  year         = {2001},
  crossref     = {DBLP:conf/popl/2001},
  url          = {https://doi.org/10.1145/360204.360210},
  doi          = {10.1145/360204.360210},
  timestamp    = {Wed, 07 Jul 2021 17:30:33 +0200},
  biburl       = {https://dblp.org/rec/conf/popl/LeeJB01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Ben-AmramJ00,
  author       = {Amir M. Ben{-}Amram and
                  Neil D. Jones},
  title        = {Computational complexity via programming languages: constant factors
                  do matter},
  journal      = {Acta Informatica},
  volume       = {37},
  number       = {2},
  pages        = {83--120},
  year         = {2000},
  url          = {https://doi.org/10.1007/s002360000038},
  doi          = {10.1007/S002360000038},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Ben-AmramJ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/fuin/Ben-AmramJ99,
  author       = {Amir M. Ben{-}Amram and
                  Neil D. Jones},
  title        = {A Precise Version of a Time Hierarchy Theorem},
  journal      = {Fundam. Informaticae},
  volume       = {38},
  number       = {1-2},
  pages        = {1--15},
  year         = {1999},
  url          = {https://doi.org/10.3233/FI-1999-381201},
  doi          = {10.3233/FI-1999-381201},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/fuin/Ben-AmramJ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/AlstrupBR99,
  author       = {Stephen Alstrup and
                  Amir M. Ben{-}Amram and
                  Theis Rauhe},
  title        = {Worst-Case and Amortised Optimality in Union-Find (Extended Abstract)},
  booktitle    = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
                  Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  pages        = {499--506},
  year         = {1999},
  crossref     = {DBLP:conf/stoc/1999},
  url          = {https://doi.org/10.1145/301250.301383},
  doi          = {10.1145/301250.301383},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/AlstrupBR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/Ben-AmramP99,
  author       = {Amir M. Ben{-}Amram and
                  Holger Petersen},
  title        = {Backing Up in Singly Linked Lists},
  booktitle    = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
                  Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  pages        = {780--786},
  year         = {1999},
  crossref     = {DBLP:conf/stoc/1999},
  url          = {https://doi.org/10.1145/301250.301450},
  doi          = {10.1145/301250.301450},
  timestamp    = {Fri, 15 Mar 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Ben-AmramP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eatcs/Ben-Amram98,
  author       = {Amir M. Ben{-}Amram},
  title        = {Introducing: Reasonable Complete Programming Languages},
  journal      = {Bull. {EATCS}},
  volume       = {64},
  year         = {1998},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eatcs/Ben-Amram98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/Ben-AmramP98,
  author       = {Amir M. Ben{-}Amram and
                  Holger Petersen},
  title        = {CONS-Free Programs with Tree Input (Extended Abstract)},
  booktitle    = {Automata, Languages and Programming, 25th International Colloquium,
                  ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
  pages        = {271--282},
  year         = {1998},
  crossref     = {DBLP:conf/icalp/1998},
  url          = {https://doi.org/10.1007/BFb0055060},
  doi          = {10.1007/BFB0055060},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/Ben-AmramP98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/Ben-Amram97,
  author       = {Amir M. Ben{-}Amram},
  title        = {When Can We Sort in o(n log n) Time?},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {54},
  number       = {2},
  pages        = {345--370},
  year         = {1997},
  url          = {https://doi.org/10.1006/jcss.1997.1474},
  doi          = {10.1006/JCSS.1997.1474},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/Ben-Amram97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/Ben-AmramJZ96,
  author       = {Amir M. Ben{-}Amram and
                  Bryant A. Julstrom and
                  Uri Zwick},
  title        = {A Note on Busy Beavers and Other Creatures},
  journal      = {Math. Syst. Theory},
  volume       = {29},
  number       = {4},
  pages        = {375--386},
  year         = {1996},
  url          = {https://doi.org/10.1007/bf01192693},
  doi          = {10.1007/BF01192693},
  timestamp    = {Tue, 16 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Ben-AmramJZ96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/il/BenAmram95,
  author       = {Amir M. Ben{-}Amram},
  title        = {On the power of random access machines},
  school       = {Tel Aviv University, Israel},
  year         = {1995},
  url          = {https://tau.primo.exlibrisgroup.com/permalink/972TAU\_INST/bai57q/alma990030720740204146},
  timestamp    = {Fri, 03 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/phd/il/BenAmram95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Ben-AmramG95,
  author       = {Amir M. Ben{-}Amram and
                  Zvi Galil},
  title        = {On the Power of the Shift Instruction},
  journal      = {Inf. Comput.},
  volume       = {117},
  number       = {1},
  pages        = {19--36},
  year         = {1995},
  url          = {https://doi.org/10.1006/inco.1995.1026},
  doi          = {10.1006/INCO.1995.1026},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Ben-AmramG95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/sigact/Ben-Amram95,
  author       = {Amir M. Ben{-}Amram},
  title        = {What is a "pointer machine"?},
  journal      = {{SIGACT} News},
  volume       = {26},
  number       = {2},
  pages        = {88--95},
  year         = {1995},
  url          = {https://doi.org/10.1145/202840.202846},
  doi          = {10.1145/202840.202846},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/sigact/Ben-Amram95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/Ben-AmramG95,
  author       = {Amir M. Ben{-}Amram and
                  Zvi Galil},
  title        = {Lower Bounds on Algebraic Random Access Machines (Extended Abstract)},
  booktitle    = {Automata, Languages and Programming, 22nd International Colloquium,
                  ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
  pages        = {360--371},
  year         = {1995},
  crossref     = {DBLP:conf/icalp/1995},
  url          = {https://doi.org/10.1007/3-540-60084-1\_88},
  doi          = {10.1007/3-540-60084-1\_88},
  timestamp    = {Tue, 05 Aug 2025 22:39:37 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/Ben-AmramG95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR95-062,
  author       = {Amir M. Ben{-}Amram and
                  Zvi Galil},
  title        = {On Data Structure Tradeoffs and an Application to Union-Find},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR95-062}},
  year         = {1995},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-062/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR95-062},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR95-062.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Ben-Amram94,
  author       = {Amir M. Ben{-}Amram},
  title        = {Unit-Cost Pointers versus Logarithmic-Cost Addresses},
  journal      = {Theor. Comput. Sci.},
  volume       = {132},
  number       = {2},
  pages        = {377--385},
  year         = {1994},
  url          = {https://doi.org/10.1016/0304-3975(93)00079-K},
  doi          = {10.1016/0304-3975(93)00079-K},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ben-Amram94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/Ben-AmramBIP94,
  author       = {Amir M. Ben{-}Amram and
                  Omer Berkman and
                  Costas S. Iliopoulos and
                  Kunsoo Park},
  title        = {The Subtree Max Gap Problem with Application to Parallel String Covering},
  booktitle    = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
                  23-25 January 1994, Arlington, Virginia, {USA}},
  pages        = {501--510},
  year         = {1994},
  crossref     = {DBLP:conf/soda/1994},
  url          = {http://dl.acm.org/citation.cfm?id=314464.314633},
  timestamp    = {Thu, 05 Jul 2018 07:29:19 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/Ben-AmramBIP94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/Ben-AmramG93,
  author       = {Amir M. Ben{-}Amram and
                  Zvi Galil},
  title        = {When can we sort in o(n log n) time?},
  booktitle    = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
                  California, USA, November 3-5, 1993},
  pages        = {538--546},
  year         = {1993},
  crossref     = {DBLP:conf/focs/FOCS34},
  url          = {https://doi.org/10.1109/SFCS.1993.366833},
  doi          = {10.1109/SFCS.1993.366833},
  timestamp    = {Tue, 08 Jul 2025 16:45:18 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/Ben-AmramG93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/Ben-AmramG92,
  author       = {Amir M. Ben{-}Amram and
                  Zvi Galil},
  title        = {On Pointers versus Addresses},
  journal      = {J. {ACM}},
  volume       = {39},
  number       = {3},
  pages        = {617--648},
  year         = {1992},
  url          = {https://doi.org/10.1145/146637.146666},
  doi          = {10.1145/146637.146666},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Ben-AmramG92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/sigact/Ben-Amram91,
  author       = {Amir M. Ben{-}Amram},
  title        = {Some notions on notations},
  journal      = {{SIGACT} News},
  volume       = {22},
  number       = {4},
  pages        = {60--62},
  year         = {1991},
  url          = {https://doi.org/10.1145/126546.126549},
  doi          = {10.1145/126546.126549},
  timestamp    = {Tue, 28 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/sigact/Ben-Amram91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/Ben-AmramG91,
  author       = {Amir M. Ben{-}Amram and
                  Zvi Galil},
  title        = {Lower Bounds for Data Structure Problems on RAMs (Extended Abstract)},
  booktitle    = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
                  Puerto Rico, October 1-4, 1991},
  pages        = {622--631},
  year         = {1991},
  crossref     = {DBLP:conf/focs/FOCS32},
  url          = {https://doi.org/10.1109/SFCS.1991.185428},
  doi          = {10.1109/SFCS.1991.185428},
  timestamp    = {Tue, 08 Jul 2025 16:46:06 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/Ben-AmramG91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/Ben-AmramG88,
  author       = {Amir M. Ben{-}Amram and
                  Zvi Galil},
  title        = {On Pointers versus Addresses (Extended Abstract)},
  booktitle    = {29th Annual Symposium on Foundations of Computer Science, White Plains,
                  New York, USA, 24-26 October 1988},
  pages        = {532--538},
  year         = {1988},
  crossref     = {DBLP:conf/focs/FOCS29},
  url          = {https://doi.org/10.1109/SFCS.1988.21969},
  doi          = {10.1109/SFCS.1988.21969},
  timestamp    = {Tue, 08 Jul 2025 16:47:01 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/Ben-AmramG88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/fossacs/2019,
  editor       = {Mikolaj Bojanczyk and
                  Alex Simpson},
  title        = {Foundations of Software Science and Computation Structures - 22nd
                  International Conference, {FOSSACS} 2019, Held as Part of the European
                  Joint Conferences on Theory and Practice of Software, {ETAPS} 2019,
                  Prague, Czech Republic, April 6-11, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11425},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-17127-8},
  doi          = {10.1007/978-3-030-17127-8},
  isbn         = {978-3-030-17126-1},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/fossacs/2019.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/sas/2019,
  editor       = {Bor{-}Yuh Evan Chang},
  title        = {Static Analysis - 26th International Symposium, {SAS} 2019, Porto,
                  Portugal, October 8-11, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11822},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-32304-2},
  doi          = {10.1007/978-3-030-32304-2},
  isbn         = {978-3-030-32303-5},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/sas/2019.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/cav/2017-2,
  editor       = {Rupak Majumdar and
                  Viktor Kuncak},
  title        = {Computer Aided Verification - 29th International Conference, {CAV}
                  2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {10427},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-63390-9},
  doi          = {10.1007/978-3-319-63390-9},
  isbn         = {978-3-319-63389-3},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/cav/2017-2.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:journals/corr/HamiltonLN16,
  editor       = {Geoff W. Hamilton and
                  Alexei Lisitsa and
                  Andrei P. Nemytykh},
  title        = {Proceedings of the Fourth International Workshop on Verification and
                  Program Transformation, VPT@ETAPS 2016, Eindhoven, The Netherlands,
                  2nd April 2016},
  series       = {{EPTCS}},
  volume       = {216},
  year         = {2016},
  url          = {https://doi.org/10.4204/EPTCS.216},
  doi          = {10.4204/EPTCS.216},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/HamiltonLN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/cav/2015,
  editor       = {Daniel Kroening and
                  Corina S. Pasareanu},
  title        = {Computer Aided Verification - 27th International Conference, {CAV}
                  2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part
                  {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {9207},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-21668-3},
  doi          = {10.1007/978-3-319-21668-3},
  isbn         = {978-3-319-21667-6},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/cav/2015.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:journals/corr/PeronP14,
  editor       = {Adriano Peron and
                  Carla Piazza},
  title        = {Proceedings Fifth International Symposium on Games, Automata, Logics
                  and Formal Verification, GandALF 2014, Verona, Italy, September 10-12,
                  2014},
  series       = {{EPTCS}},
  volume       = {161},
  year         = {2014},
  url          = {https://doi.org/10.4204/EPTCS.161},
  doi          = {10.4204/EPTCS.161},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/PeronP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/cav/2013vpt,
  editor       = {Alexei Lisitsa and
                  Andrei P. Nemytykh},
  title        = {First International Workshop on Verification and Program Transformation,
                  {VPT} 2013, Saint Petersburg, Russia, July 12-13, 2013},
  series       = {EPiC Series in Computing},
  volume       = {16},
  publisher    = {EasyChair},
  year         = {2013},
  url          = {https://easychair.org/publications/volume/VPT\_2013},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/cav/2013vpt.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/popl/2013,
  editor       = {Roberto Giacobazzi and
                  Radhia Cousot},
  title        = {The 40th Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of
                  Programming Languages, {POPL} '13, Rome, Italy - January 23 - 25,
                  2013},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2429069},
  doi          = {10.1145/2429069},
  isbn         = {978-1-4503-1832-7},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/popl/2013.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/stacs/2013,
  editor       = {Natacha Portier and
                  Thomas Wilke},
  title        = {30th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
  series       = {LIPIcs},
  volume       = {20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2013},
  url          = {http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=13002},
  isbn         = {978-3-939897-50-7},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/2013.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/vmcai/2012,
  editor       = {Viktor Kuncak and
                  Andrey Rybalchenko},
  title        = {Verification, Model Checking, and Abstract Interpretation - 13th International
                  Conference, {VMCAI} 2012, Philadelphia, PA, USA, January 22-24, 2012.
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7148},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-27940-9},
  doi          = {10.1007/978-3-642-27940-9},
  isbn         = {978-3-642-27939-3},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/vmcai/2012.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:journals/corr/abs-1005-0653,
  editor       = {Patrick Baillot},
  title        = {Proceedings International Workshop on Developments in Implicit Computational
                  complExity, {DICE} 2010, Paphos, Cyprus, 27-28th March 2010},
  series       = {{EPTCS}},
  volume       = {23},
  year         = {2010},
  url          = {https://doi.org/10.4204/EPTCS.23},
  doi          = {10.4204/EPTCS.23},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1005-0653.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/cav/2009,
  editor       = {Ahmed Bouajjani and
                  Oded Maler},
  title        = {Computer Aided Verification, 21st International Conference, {CAV}
                  2009, Grenoble, France, June 26 - July 2, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5643},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-02658-4},
  doi          = {10.1007/978-3-642-02658-4},
  isbn         = {978-3-642-02657-7},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/cav/2009.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/cie/2008,
  editor       = {Arnold Beckmann and
                  Costas Dimitracopoulos and
                  Benedikt L{\"{o}}we},
  title        = {Logic and Theory of Algorithms, 4th Conference on Computability in
                  Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5028},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-69407-6},
  doi          = {10.1007/978-3-540-69407-6},
  isbn         = {978-3-540-69405-2},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/cie/2008.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/tacas/2008,
  editor       = {C. R. Ramakrishnan and
                  Jakob Rehof},
  title        = {Tools and Algorithms for the Construction and Analysis of Systems,
                  14th International Conference, {TACAS} 2008, Held as Part of the Joint
                  European Conferences on Theory and Practice of Software, {ETAPS} 2008,
                  Budapest, Hungary, March 29-April 6, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4963},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-78800-3},
  doi          = {10.1007/978-3-540-78800-3},
  isbn         = {978-3-540-78799-0},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/tacas/2008.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/birthday/2002jones,
  editor       = {Torben {\AE}. Mogensen and
                  David A. Schmidt and
                  Ivan Hal Sudborough},
  title        = {The Essence of Computation, Complexity, Analysis, Transformation.
                  Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday]},
  series       = {Lecture Notes in Computer Science},
  volume       = {2566},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-36377-7},
  doi          = {10.1007/3-540-36377-7},
  isbn         = {3-540-00326-6},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/birthday/2002jones.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/popl/2001,
  editor       = {Chris Hankin and
                  Dave Schmidt},
  title        = {Conference Record of {POPL} 2001: The 28th {ACM} {SIGPLAN-SIGACT}
                  Symposium on Principles of Programming Languages, London, UK, January
                  17-19, 2001},
  publisher    = {{ACM}},
  year         = {2001},
  url          = {https://doi.org/10.1145/360204},
  doi          = {10.1145/360204},
  isbn         = {1-58113-336-7},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/popl/2001.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/stoc/1999,
  editor       = {Jeffrey Scott Vitter and
                  Lawrence L. Larmore and
                  Frank Thomson Leighton},
  title        = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
                  Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  publisher    = {{ACM}},
  year         = {1999},
  isbn         = {1-58113-067-8},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/1999.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/icalp/1998,
  editor       = {Kim Guldstrand Larsen and
                  Sven Skyum and
                  Glynn Winskel},
  title        = {Automata, Languages and Programming, 25th International Colloquium,
                  ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1443},
  publisher    = {Springer},
  year         = {1998},
  url          = {https://doi.org/10.1007/BFb0055035},
  doi          = {10.1007/BFB0055035},
  isbn         = {3-540-64781-3},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/1998.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/icalp/1995,
  editor       = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
                  Ferenc G{\'{e}}cseg},
  title        = {Automata, Languages and Programming, 22nd International Colloquium,
                  ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {944},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/3-540-60084-1},
  doi          = {10.1007/3-540-60084-1},
  isbn         = {3-540-60084-1},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/1995.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/soda/1994,
  editor       = {Daniel Dominic Sleator},
  title        = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
                  23-25 January 1994, Arlington, Virginia, {USA}},
  publisher    = {{ACM/SIAM}},
  year         = {1994},
  url          = {http://dl.acm.org/citation.cfm?id=314464},
  isbn         = {0-89871-329-3},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/1994.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/focs/FOCS34,
  title        = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
                  California, USA, November 3-5, 1993},
  publisher    = {{IEEE} Computer Society},
  year         = {1993},
  url          = {https://ieeexplore.ieee.org/xpl/conhome/2962/proceeding},
  isbn         = {0-8186-4370-6},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/FOCS34.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/focs/FOCS32,
  title        = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
                  Puerto Rico, October 1-4, 1991},
  publisher    = {{IEEE} Computer Society},
  year         = {1991},
  url          = {https://doi.org/10.1109/SFCS.1991},
  doi          = {10.1109/SFCS.1991},
  isbn         = {0-8186-2445-0},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/FOCS32.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/focs/FOCS29,
  title        = {29th Annual Symposium on Foundations of Computer Science, White Plains,
                  New York, USA, 24-26 October 1988},
  publisher    = {{IEEE} Computer Society},
  year         = {1988},
  url          = {https://doi.org/10.1109/SFCS.1988},
  doi          = {10.1109/SFCS.1988},
  isbn         = {0-8186-0877-3},
  timestamp    = {Sat, 15 Nov 2025 14:08:34 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/FOCS29.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.