Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Neil Immerman
@article{DBLP:journals/corr/abs-2401-11282,
author = {Neil Immerman},
title = {What Juris Hartmanis taught me about Reductions},
journal = {CoRR},
volume = {abs/2401.11282},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.11282},
doi = {10.48550/ARXIV.2401.11282},
eprinttype = {arXiv},
eprint = {2401.11282},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-11282.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-10293,
author = {Marco Carmosino and
Ronald Fagin and
Neil Immerman and
Phokion G. Kolaitis and
Jonathan Lenchner and
Rik Sengupta and
R. Ryan Williams},
title = {Parallel Play Saves Quantifiers},
journal = {CoRR},
volume = {abs/2402.10293},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.10293},
doi = {10.48550/ARXIV.2402.10293},
eprinttype = {arXiv},
eprint = {2402.10293},
timestamp = {Mon, 26 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-10293.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-13329,
author = {Marco Carmosino and
Ronald Fagin and
Neil Immerman and
Phokion G. Kolaitis and
Jonathan Lenchner and
Rik Sengupta},
title = {A Finer Analysis of Multi-Structural Games and Beyond},
journal = {CoRR},
volume = {abs/2301.13329},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.13329},
doi = {10.48550/ARXIV.2301.13329},
eprinttype = {arXiv},
eprint = {2301.13329},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-13329.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/EladRIKS21,
author = {Neta Elad and
Sophie Rain and
Neil Immerman and
Laura Kov{\'{a}}cs and
Mooly Sagiv},
editor = {Alexandra Silva and
K. Rustan M. Leino},
title = {Summing up Smart Transitions},
booktitle = {Computer Aided Verification - 33rd International Conference, {CAV}
2021, Virtual Event, July 20-23, 2021, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {12759},
pages = {317--340},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-81685-8\_15},
doi = {10.1007/978-3-030-81685-8\_15},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cav/EladRIKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-07663,
author = {Neta Elad and
Sophie Rain and
Neil Immerman and
Laura Kov{\'{a}}cs and
Mooly Sagiv},
title = {Summing Up Smart Transitions},
journal = {CoRR},
volume = {abs/2105.07663},
year = {2021},
url = {https://arxiv.org/abs/2105.07663},
eprinttype = {arXiv},
eprint = {2105.07663},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-07663.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pacmpl/FeldmanISS20,
author = {Yotam M. Y. Feldman and
Neil Immerman and
Mooly Sagiv and
Sharon Shoham},
title = {Complexity and information in invariant inference},
journal = {Proc. {ACM} Program. Lang.},
volume = {4},
number = {{POPL}},
pages = {5:1--5:29},
year = {2020},
url = {https://doi.org/10.1145/3371073},
doi = {10.1145/3371073},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pacmpl/FeldmanISS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Immerman20,
author = {Neil Immerman},
title = {Complexity column},
journal = {{ACM} {SIGLOG} News},
volume = {7},
number = {1},
pages = {3},
year = {2020},
url = {https://doi.org/10.1145/3385634.3385635},
doi = {10.1145/3385634.3385635},
timestamp = {Wed, 27 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siglog/Immerman20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Immerman20a,
author = {Neil Immerman},
title = {Complexity column},
journal = {{ACM} {SIGLOG} News},
volume = {7},
number = {3},
pages = {4},
year = {2020},
url = {https://doi.org/10.1145/3436980.3436981},
doi = {10.1145/3436980.3436981},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siglog/Immerman20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pldi/KoenigPIA20,
author = {Jason R. Koenig and
Oded Padon and
Neil Immerman and
Alex Aiken},
editor = {Alastair F. Donaldson and
Emina Torlak},
title = {First-order quantified separators},
booktitle = {Proceedings of the 41st {ACM} {SIGPLAN} International Conference on
Programming Language Design and Implementation, {PLDI} 2020, London,
UK, June 15-20, 2020},
pages = {703--717},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3385412.3386018},
doi = {10.1145/3385412.3386018},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pldi/KoenigPIA20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/FreireGIM20,
author = {Cibele Freire and
Wolfgang Gatterbauer and
Neil Immerman and
Alexandra Meliou},
editor = {Dan Suciu and
Yufei Tao and
Zhewei Wei},
title = {New Results for the Complexity of Resilience for Binary Conjunctive
Queries with Self-Joins},
booktitle = {Proceedings of the 39th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2020, Portland, OR, USA, June 14-19, 2020},
pages = {271--284},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3375395.3387647},
doi = {10.1145/3375395.3387647},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/FreireGIM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/FeldmanPISS19,
author = {Yotam M. Y. Feldman and
Oded Padon and
Neil Immerman and
Mooly Sagiv and
Sharon Shoham},
title = {Bounded Quantifier Instantiation for Checking Inductive Invariants},
journal = {Log. Methods Comput. Sci.},
volume = {15},
number = {3},
year = {2019},
url = {https://doi.org/10.23638/LMCS-15(3:18)2019},
doi = {10.23638/LMCS-15(3:18)2019},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/FeldmanPISS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-01129,
author = {Cibele Freire and
Wolfgang Gatterbauer and
Neil Immerman and
Alexandra Meliou},
title = {New Results for the Complexity of Resilience for Binary Conjunctive
Queries with Self-Joins},
journal = {CoRR},
volume = {abs/1907.01129},
year = {2019},
url = {http://arxiv.org/abs/1907.01129},
eprinttype = {arXiv},
eprint = {1907.01129},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-01129.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-09582,
author = {Neil Immerman and
Rik Sengupta},
title = {The k-Dimensional Weisfeiler-Leman Algorithm},
journal = {CoRR},
volume = {abs/1907.09582},
year = {2019},
url = {http://arxiv.org/abs/1907.09582},
eprinttype = {arXiv},
eprint = {1907.09582},
timestamp = {Tue, 30 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-09582.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-12256,
author = {Yotam M. Y. Feldman and
Neil Immerman and
Mooly Sagiv and
Sharon Shoham},
title = {Complexity and Information in Invariant Inference},
journal = {CoRR},
volume = {abs/1910.12256},
year = {2019},
url = {http://arxiv.org/abs/1910.12256},
eprinttype = {arXiv},
eprint = {1910.12256},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-12256.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Immerman18,
author = {Neil Immerman},
title = {Complexity column},
journal = {{ACM} {SIGLOG} News},
volume = {5},
number = {3},
pages = {21},
year = {2018},
url = {https://doi.org/10.1145/3242953.3242957},
doi = {10.1145/3242953.3242957},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siglog/Immerman18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Immerman18a,
author = {Neil Immerman},
title = {Complexity column},
journal = {{ACM} {SIGLOG} News},
volume = {5},
number = {4},
pages = {3},
year = {2018},
url = {https://doi.org/10.1145/3292048.3292049},
doi = {10.1145/3292048.3292049},
timestamp = {Wed, 27 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siglog/Immerman18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Immerman17,
author = {Neil Immerman},
title = {Complexity column},
journal = {{ACM} {SIGLOG} News},
volume = {4},
number = {2},
pages = {28},
year = {2017},
url = {https://doi.org/10.1145/3090064.3090067},
doi = {10.1145/3090064.3090067},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siglog/Immerman17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Immerman17a,
author = {Neil Immerman},
title = {Complexity column},
journal = {{ACM} {SIGLOG} News},
volume = {4},
number = {3},
pages = {27},
year = {2017},
url = {https://doi.org/10.1145/3129173.3129179},
doi = {10.1145/3129173.3129179},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siglog/Immerman17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tacas/FeldmanPISS17,
author = {Yotam M. Y. Feldman and
Oded Padon and
Neil Immerman and
Mooly Sagiv and
Sharon Shoham},
editor = {Axel Legay and
Tiziana Margaria},
title = {Bounded Quantifier Instantiation for Checking Inductive Invariants},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
- 23rd International Conference, {TACAS} 2017, Held as Part of the
European Joint Conferences on Theory and Practice of Software, {ETAPS}
2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {10205},
pages = {76--95},
year = {2017},
url = {https://doi.org/10.1007/978-3-662-54577-5\_5},
doi = {10.1007/978-3-662-54577-5\_5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tacas/FeldmanPISS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-08668,
author = {Yotam M. Y. Feldman and
Oded Padon and
Neil Immerman and
Mooly Sagiv and
Sharon Shoham},
title = {Bounded Quantifier Instantiation for Checking Inductive Invariants},
journal = {CoRR},
volume = {abs/1710.08668},
year = {2017},
url = {http://arxiv.org/abs/1710.08668},
eprinttype = {arXiv},
eprint = {1710.08668},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-08668.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Immerman16,
author = {Neil Immerman},
title = {Complexity column},
journal = {{ACM} {SIGLOG} News},
volume = {3},
number = {1},
pages = {22},
year = {2016},
url = {https://doi.org/10.1145/2893582.2893587},
doi = {10.1145/2893582.2893587},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siglog/Immerman16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Immerman16a,
author = {Neil Immerman},
title = {Complexity column},
journal = {{ACM} {SIGLOG} News},
volume = {3},
number = {2},
pages = {29},
year = {2016},
url = {https://doi.org/10.1145/2948896.2948898},
doi = {10.1145/2948896.2948898},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siglog/Immerman16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Immerman16b,
author = {Neil Immerman},
title = {Complexity column},
journal = {{ACM} {SIGLOG} News},
volume = {3},
number = {3},
pages = {20},
year = {2016},
url = {https://doi.org/10.1145/2984450.2984454},
doi = {10.1145/2984450.2984454},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siglog/Immerman16b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/popl/PadonISKS16,
author = {Oded Padon and
Neil Immerman and
Sharon Shoham and
Aleksandr Karbyshev and
Mooly Sagiv},
editor = {Rastislav Bod{\'{\i}}k and
Rupak Majumdar},
title = {Decidability of inferring inductive invariants},
booktitle = {Proceedings of the 43rd Annual {ACM} {SIGPLAN-SIGACT} Symposium on
Principles of Programming Languages, {POPL} 2016, St. Petersburg,
FL, USA, January 20 - 22, 2016},
pages = {217--231},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2837614.2837640},
doi = {10.1145/2837614.2837640},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/popl/PadonISKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/FreireGIM15,
author = {Cibele Freire and
Wolfgang Gatterbauer and
Neil Immerman and
Alexandra Meliou},
title = {The Complexity of Resilience and Responsibility for Self-Join-Free
Conjunctive Queries},
journal = {Proc. {VLDB} Endow.},
volume = {9},
number = {3},
pages = {180--191},
year = {2015},
url = {http://www.vldb.org/pvldb/vol9/p180-freire.pdf},
doi = {10.14778/2850583.2850592},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/FreireGIM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/popl/PadonIKLSS15,
author = {Oded Padon and
Neil Immerman and
Aleksandr Karbyshev and
Ori Lahav and
Mooly Sagiv and
Sharon Shoham},
editor = {Sriram K. Rajamani and
David Walker},
title = {Decentralizing {SDN} Policies},
booktitle = {Proceedings of the 42nd Annual {ACM} {SIGPLAN-SIGACT} Symposium on
Principles of Programming Languages, {POPL} 2015, Mumbai, India, January
15-17, 2015},
pages = {663--676},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2676726.2676990},
doi = {10.1145/2676726.2676990},
timestamp = {Mon, 08 Apr 2024 08:19:10 +0200},
biburl = {https://dblp.org/rec/conf/popl/PadonIKLSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FreireGIM15,
author = {Cibele Freire and
Wolfgang Gatterbauer and
Neil Immerman and
Alexandra Meliou},
title = {A Characterization of the Complexity of Resilience and Responsibility
for Self-join-free Conjunctive Queries},
journal = {CoRR},
volume = {abs/1507.00674},
year = {2015},
url = {http://arxiv.org/abs/1507.00674},
eprinttype = {arXiv},
eprint = {1507.00674},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FreireGIM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Immerman14,
author = {Neil Immerman},
title = {Complexity column},
journal = {{ACM} {SIGLOG} News},
volume = {1},
number = {1},
pages = {5},
year = {2014},
url = {https://doi.org/10.1145/2657460.2657463},
doi = {10.1145/2657460.2657463},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siglog/Immerman14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/popl/ItzhakyBILNS14,
author = {Shachar Itzhaky and
Anindya Banerjee and
Neil Immerman and
Ori Lahav and
Aleksandar Nanevski and
Mooly Sagiv},
editor = {Suresh Jagannathan and
Peter Sewell},
title = {Modular reasoning about heap paths via effectively propositional formulas},
booktitle = {The 41st Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of
Programming Languages, {POPL} '14, San Diego, CA, USA, January 20-21,
2014},
pages = {385--396},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2535838.2535854},
doi = {10.1145/2535838.2535854},
timestamp = {Fri, 22 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/popl/ItzhakyBILNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmod/ZhangDI14,
author = {Haopeng Zhang and
Yanlei Diao and
Neil Immerman},
editor = {Curtis E. Dyreson and
Feifei Li and
M. Tamer {\"{O}}zsu},
title = {On complexity and optimization of expensive queries in complex event
processing},
booktitle = {International Conference on Management of Data, {SIGMOD} 2014, Snowbird,
UT, USA, June 22-27, 2014},
pages = {217--228},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2588555.2593671},
doi = {10.1145/2588555.2593671},
timestamp = {Thu, 18 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigmod/ZhangDI14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/is/ZhangDI13,
author = {Haopeng Zhang and
Yanlei Diao and
Neil Immerman},
title = {Recognizing patterns in streams with imprecise timestamps},
journal = {Inf. Syst.},
volume = {38},
number = {8},
pages = {1187--1211},
year = {2013},
url = {https://doi.org/10.1016/j.is.2012.01.002},
doi = {10.1016/J.IS.2012.01.002},
timestamp = {Thu, 18 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/is/ZhangDI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/vldb/LuMI13,
author = {Wentian Lu and
Gerome Miklau and
Neil Immerman},
title = {Auditing a database under retention policies},
journal = {{VLDB} J.},
volume = {22},
number = {2},
pages = {203--228},
year = {2013},
url = {https://doi.org/10.1007/s00778-012-0282-x},
doi = {10.1007/S00778-012-0282-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/vldb/LuMI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/ItzhakyBINS13,
author = {Shachar Itzhaky and
Anindya Banerjee and
Neil Immerman and
Aleksandar Nanevski and
Mooly Sagiv},
editor = {Natasha Sharygina and
Helmut Veith},
title = {Effectively-Propositional Reasoning about Reachability in Linked Data
Structures},
booktitle = {Computer Aided Verification - 25th International Conference, {CAV}
2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8044},
pages = {756--772},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39799-8\_53},
doi = {10.1007/978-3-642-39799-8\_53},
timestamp = {Wed, 07 Dec 2022 23:12:58 +0100},
biburl = {https://dblp.org/rec/conf/cav/ItzhakyBINS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lpar/ItzhakyGIS13,
author = {Shachar Itzhaky and
Sumit Gulwani and
Neil Immerman and
Mooly Sagiv},
editor = {Kenneth L. McMillan and
Aart Middeldorp and
Andrei Voronkov},
title = {Solving Geometry Problems Using a Combination of Symbolic and Numerical
Reasoning},
booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning - 19th
International Conference, LPAR-19, Stellenbosch, South Africa, December
14-19, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8312},
pages = {457--472},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45221-5\_31},
doi = {10.1007/978-3-642-45221-5\_31},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/lpar/ItzhakyGIS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-3836,
author = {Daniel S. Bernstein and
Shlomo Zilberstein and
Neil Immerman},
title = {The Complexity of Decentralized Control of Markov Decision Processes},
journal = {CoRR},
volume = {abs/1301.3836},
year = {2013},
url = {http://arxiv.org/abs/1301.3836},
eprinttype = {arXiv},
eprint = {1301.3836},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-3836.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/SrivastavaIZ12,
author = {Siddharth Srivastava and
Neil Immerman and
Shlomo Zilberstein},
title = {Applicability conditions for plans with loops: Computability results
and algorithms},
journal = {Artif. Intell.},
volume = {191-192},
pages = {1--19},
year = {2012},
url = {https://doi.org/10.1016/j.artint.2012.07.005},
doi = {10.1016/J.ARTINT.2012.07.005},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ai/SrivastavaIZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/CarmosinoIJ12,
author = {Marco Carmosino and
Neil Immerman and
Charles Jordan},
editor = {Robert L. Constable and
Alexandra Silva},
title = {Experimental Descriptive Complexity},
booktitle = {Logic and Program Semantics - Essays Dedicated to Dexter Kozen on
the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {7230},
pages = {24--34},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29485-3\_3},
doi = {10.1007/978-3-642-29485-3\_3},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/CarmosinoIJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecoop/ReichenbachSI12,
author = {Christoph Reichenbach and
Yannis Smaragdakis and
Neil Immerman},
editor = {James Noble},
title = {{PQL:} {A} Purely-Declarative Java Extension for Parallel Programming},
booktitle = {{ECOOP} 2012 - Object-Oriented Programming - 26th European Conference,
Beijing, China, June 11-16, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7313},
pages = {53--78},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31057-7\_4},
doi = {10.1007/978-3-642-31057-7\_4},
timestamp = {Fri, 27 Mar 2020 08:51:54 +0100},
biburl = {https://dblp.org/rec/conf/ecoop/ReichenbachSI12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/SrivastavaIZ11,
author = {Siddharth Srivastava and
Neil Immerman and
Shlomo Zilberstein},
title = {A new representation and associated algorithms for generalized planning},
journal = {Artif. Intell.},
volume = {175},
number = {2},
pages = {615--647},
year = {2011},
url = {https://doi.org/10.1016/j.artint.2010.10.006},
doi = {10.1016/J.ARTINT.2010.10.006},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ai/SrivastavaIZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/SrivastavaZIG11,
author = {Siddharth Srivastava and
Shlomo Zilberstein and
Neil Immerman and
Hector Geffner},
editor = {Wolfram Burgard and
Dan Roth},
title = {Qualitative Numeric Planning},
booktitle = {Proceedings of the Twenty-Fifth {AAAI} Conference on Artificial Intelligence,
{AAAI} 2011, San Francisco, California, USA, August 7-11, 2011},
pages = {1010--1016},
publisher = {{AAAI} Press},
year = {2011},
url = {https://doi.org/10.1609/aaai.v25i1.8013},
doi = {10.1609/AAAI.V25I1.8013},
timestamp = {Mon, 04 Sep 2023 16:05:54 +0200},
biburl = {https://dblp.org/rec/conf/aaai/SrivastavaZIG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/SrivastavaIZ11,
author = {Siddharth Srivastava and
Neil Immerman and
Shlomo Zilberstein},
editor = {Wolfram Burgard and
Dan Roth},
title = {Termination and Correctness Analysis of Cyclic Control},
booktitle = {Proceedings of the Twenty-Fifth {AAAI} Conference on Artificial Intelligence,
{AAAI} 2011, San Francisco, California, USA, August 7-11, 2011},
pages = {1567--1570},
publisher = {{AAAI} Press},
year = {2011},
url = {https://doi.org/10.1609/aaai.v25i1.7963},
doi = {10.1609/AAAI.V25I1.7963},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/SrivastavaIZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aips/SrivastavaIZZ11,
author = {Siddharth Srivastava and
Neil Immerman and
Shlomo Zilberstein and
Tianjiao Zhang},
editor = {Fahiem Bacchus and
Carmel Domshlak and
Stefan Edelkamp and
Malte Helmert},
title = {Directed Search for Generalized Plans Using Classical Planners},
booktitle = {Proceedings of the 21st International Conference on Automated Planning
and Scheduling, {ICAPS} 2011, Freiburg, Germany June 11-16, 2011},
publisher = {{AAAI}},
year = {2011},
url = {http://aaai.org/ocs/index.php/ICAPS/ICAPS11/paper/view/2711},
timestamp = {Tue, 28 Jun 2011 14:20:04 +0200},
biburl = {https://dblp.org/rec/conf/aips/SrivastavaIZZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/ZhangDI10,
author = {Haopeng Zhang and
Yanlei Diao and
Neil Immerman},
title = {Recognizing Patterns in Streams with Imprecise Timestamps},
journal = {Proc. {VLDB} Endow.},
volume = {3},
number = {1},
pages = {244--255},
year = {2010},
url = {http://www.vldb.org/pvldb/vldb2010/pvldb\_vol3/R21.pdf},
doi = {10.14778/1920841.1920875},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/ZhangDI10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aips/SrivastavaIZ10,
author = {Siddharth Srivastava and
Neil Immerman and
Shlomo Zilberstein},
editor = {Ronen I. Brafman and
Hector Geffner and
J{\"{o}}rg Hoffmann and
Henry A. Kautz},
title = {Computing Applicability Conditions for Plans with Loops},
booktitle = {Proceedings of the 20th International Conference on Automated Planning
and Scheduling, {ICAPS} 2010, Toronto, Ontario, Canada, May 12-16,
2010},
pages = {161--168},
publisher = {{AAAI}},
year = {2010},
url = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1448},
timestamp = {Thu, 31 Jul 2014 11:17:14 +0200},
biburl = {https://dblp.org/rec/conf/aips/SrivastavaIZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/SrivastavaIZ10,
author = {Siddharth Srivastava and
Neil Immerman and
Shlomo Zilberstein},
editor = {Wiebe van der Hoek and
Gal A. Kaminka and
Yves Lesp{\'{e}}rance and
Michael Luck and
Sandip Sen},
title = {Merging example plans into generalized plans for non-deterministic
environments},
booktitle = {9th International Conference on Autonomous Agents and Multiagent Systems
{(AAMAS} 2010), Toronto, Canada, May 10-14, 2010, Volume 1-3},
pages = {1341--1348},
publisher = {{IFAAMAS}},
year = {2010},
url = {https://dl.acm.org/citation.cfm?id=1838382},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atal/SrivastavaIZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/CrouchIM10,
author = {Michael S. Crouch and
Neil Immerman and
J. Eliot B. Moss},
editor = {Andreas Blass and
Nachum Dershowitz and
Wolfgang Reisig},
title = {Finding Reductions Automatically},
booktitle = {Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich
on the Occasion of His 70th Birthday},
series = {Lecture Notes in Computer Science},
volume = {6300},
pages = {181--200},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15025-8\_10},
doi = {10.1007/978-3-642-15025-8\_10},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/birthday/CrouchIM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/oopsla/ItzhakyGIS10,
author = {Shachar Itzhaky and
Sumit Gulwani and
Neil Immerman and
Mooly Sagiv},
editor = {William R. Cook and
Siobh{\'{a}}n Clarke and
Martin C. Rinard},
title = {A simple inductive synthesis methodology and its applications},
booktitle = {Proceedings of the 25th Annual {ACM} {SIGPLAN} Conference on Object-Oriented
Programming, Systems, Languages, and Applications, {OOPSLA} 2010,
October 17-21, 2010, Reno/Tahoe, Nevada, {USA}},
pages = {36--46},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1869459.1869463},
doi = {10.1145/1869459.1869463},
timestamp = {Tue, 22 Jun 2021 17:10:56 +0200},
biburl = {https://dblp.org/rec/conf/oopsla/ItzhakyGIS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/oopsla/ReichenbachISAG10,
author = {Christoph Reichenbach and
Neil Immerman and
Yannis Smaragdakis and
Edward Aftandilian and
Samuel Z. Guyer},
editor = {William R. Cook and
Siobh{\'{a}}n Clarke and
Martin C. Rinard},
title = {What can the {GC} compute efficiently?: a language for heap assertions
at {GC} time},
booktitle = {Proceedings of the 25th Annual {ACM} {SIGPLAN} Conference on Object-Oriented
Programming, Systems, Languages, and Applications, {OOPSLA} 2010,
October 17-21, 2010, Reno/Tahoe, Nevada, {USA}},
pages = {256--269},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1869459.1869482},
doi = {10.1145/1869459.1869482},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/oopsla/ReichenbachISAG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-4902,
author = {Tal Lev{-}Ami and
Neil Immerman and
Thomas W. Reps and
Mooly Sagiv and
Siddharth Srivastava and
Greta Yorsh},
title = {Simulating reachability using first-order logic with applications
to verification of linked data structures},
journal = {Log. Methods Comput. Sci.},
volume = {5},
number = {2},
year = {2009},
url = {http://arxiv.org/abs/0904.4902},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0904-4902.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-0616,
author = {Philipp Weis and
Neil Immerman},
title = {Structure Theorem and Strict Alternation Hierarchy for FO{\^{}}2 on
Words},
journal = {Log. Methods Comput. Sci.},
volume = {5},
number = {3},
year = {2009},
url = {http://arxiv.org/abs/0907.0616},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-0616.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AllenderBISV09,
author = {Eric Allender and
Michael Bauland and
Neil Immerman and
Henning Schnoor and
Heribert Vollmer},
title = {The complexity of satisfiability problems: Refining Schaefer's theorem},
journal = {J. Comput. Syst. Sci.},
volume = {75},
number = {4},
pages = {245--254},
year = {2009},
url = {https://doi.org/10.1016/j.jcss.2008.11.001},
doi = {10.1016/J.JCSS.2008.11.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AllenderBISV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sara/SrivastavaIZ09,
author = {Siddharth Srivastava and
Neil Immerman and
Shlomo Zilberstein},
editor = {Vadim Bulitko and
J. Christopher Beck},
title = {Abstract Planning with Unknown Object Quantities and Properties},
booktitle = {Eighth Symposium on Abstraction, Reformulation, and Approximation,
{SARA} 2009, Lake Arrowhead, California, USA, 8-10 August 2009},
publisher = {{AAAI}},
year = {2009},
url = {http://www.aaai.org/ocs/index.php/SARA/SARA09/paper/view/827},
timestamp = {Tue, 08 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sara/SrivastavaIZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/AlurABEIL08,
author = {Rajeev Alur and
Marcelo Arenas and
Pablo Barcel{\'{o}} and
Kousha Etessami and
Neil Immerman and
Leonid Libkin},
title = {First-Order and Temporal Logics for Nested Words},
journal = {Log. Methods Comput. Sci.},
volume = {4},
number = {4},
year = {2008},
url = {https://doi.org/10.2168/LMCS-4(4:11)2008},
doi = {10.2168/LMCS-4(4:11)2008},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/AlurABEIL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/SrivastavaIZ08,
author = {Siddharth Srivastava and
Neil Immerman and
Shlomo Zilberstein},
editor = {Dieter Fox and
Carla P. Gomes},
title = {Learning Generalized Plans Using Abstract Counting},
booktitle = {Proceedings of the Twenty-Third {AAAI} Conference on Artificial Intelligence,
{AAAI} 2008, Chicago, Illinois, USA, July 13-17, 2008},
pages = {991--997},
publisher = {{AAAI} Press},
year = {2008},
url = {http://www.aaai.org/Library/AAAI/2008/aaai08-157.php},
timestamp = {Tue, 05 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/SrivastavaIZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/GyllstromADI08,
author = {Daniel Gyllstrom and
Jagrati Agrawal and
Yanlei Diao and
Neil Immerman},
editor = {Gustavo Alonso and
Jos{\'{e}} A. Blakeley and
Arbee L. P. Chen},
title = {On Supporting Kleene Closure over Event Streams},
booktitle = {Proceedings of the 24th International Conference on Data Engineering,
{ICDE} 2008, April 7-12, 2008, Canc{\'{u}}n, Mexico},
pages = {1391--1393},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/ICDE.2008.4497566},
doi = {10.1109/ICDE.2008.4497566},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icde/GyllstromADI08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/SrivastavaIZ08,
author = {Siddharth Srivastava and
Neil Immerman and
Shlomo Zilberstein},
title = {Using Abstraction for Generalized Planning},
booktitle = {International Symposium on Artificial Intelligence and Mathematics,
{ISAIM} 2008, Fort Lauderdale, Florida, USA, January 2-4, 2008},
year = {2008},
url = {http://isaim2008.unl.edu/PAPERS/TechnicalProgram/ISAIM2008\_0021\_1b4ce0c9de9475c491b30aee48568e9c.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaim/SrivastavaIZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmod/AgrawalDGI08,
author = {Jagrati Agrawal and
Yanlei Diao and
Daniel Gyllstrom and
Neil Immerman},
editor = {Jason Tsong{-}Li Wang},
title = {Efficient pattern matching over event streams},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management
of Data, {SIGMOD} 2008, Vancouver, BC, Canada, June 10-12, 2008},
pages = {147--160},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1376616.1376634},
doi = {10.1145/1376616.1376634},
timestamp = {Tue, 16 Aug 2022 23:04:20 +0200},
biburl = {https://dblp.org/rec/conf/sigmod/AgrawalDGI08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-0537,
author = {Rajeev Alur and
Marcelo Arenas and
Pablo Barcel{\'{o}} and
Kousha Etessami and
Neil Immerman and
Leonid Libkin},
title = {First-Order and Temporal Logics for Nested Words},
journal = {CoRR},
volume = {abs/0811.0537},
year = {2008},
url = {http://arxiv.org/abs/0811.0537},
eprinttype = {arXiv},
eprint = {0811.0537},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-0537.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/WeisI07,
author = {Philipp Weis and
Neil Immerman},
editor = {Jacques Duparc and
Thomas A. Henzinger},
title = {Structure Theorem and Strict Alternation Hierarchy for FO\({}^{\mbox{2}}\)
on Words},
booktitle = {Computer Science Logic, 21st International Workshop, {CSL} 2007, 16th
Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15,
2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4646},
pages = {343--357},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74915-8\_27},
doi = {10.1007/978-3-540-74915-8\_27},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/WeisI07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/AlurABEIL07,
author = {Rajeev Alur and
Marcelo Arenas and
Pablo Barcel{\'{o}} and
Kousha Etessami and
Neil Immerman and
Leonid Libkin},
title = {First-Order and Temporal Logics for Nested Words},
booktitle = {22nd {IEEE} Symposium on Logic in Computer Science {(LICS} 2007),
10-12 July 2007, Wroclaw, Poland, Proceedings},
pages = {151--160},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/LICS.2007.19},
doi = {10.1109/LICS.2007.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/AlurABEIL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vmcai/Lev-AmiSIR07,
author = {Tal Lev{-}Ami and
Mooly Sagiv and
Neil Immerman and
Thomas W. Reps},
editor = {Byron Cook and
Andreas Podelski},
title = {Constructing Specialized Shape Analyses for Uniform Change},
booktitle = {Verification, Model Checking, and Abstract Interpretation, 8th International
Conference, {VMCAI} 2007, Nice, France, January 14-16, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4349},
pages = {215--233},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-69738-1\_16},
doi = {10.1007/978-3-540-69738-1\_16},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/vmcai/Lev-AmiSIR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/WeisI07,
author = {Philipp Weis and
Neil Immerman},
title = {Structure Theorem and Strict Alternation Hierarchy for FO{\^{}}2 on
Words},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-008}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-008/index.html},
eprinttype = {ECCC},
eprint = {TR07-008},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/WeisI07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/Lev-AmiIS06,
author = {Tal Lev{-}Ami and
Neil Immerman and
Shmuel Sagiv},
editor = {Thomas Ball and
Robert B. Jones},
title = {Abstraction for Shape Analysis with Fast and Precise Transformers},
booktitle = {Computer Aided Verification, 18th International Conference, {CAV}
2006, Seattle, WA, USA, August 17-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4144},
pages = {547--561},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11817963\_49},
doi = {10.1007/11817963\_49},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/cav/Lev-AmiIS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/WeisI06,
author = {Philipp Weis and
Neil Immerman},
editor = {Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
title = {Structure Theorem and Strict Alternation Hierarchy for FO\({}^{\mbox{2}}\)
on Words},
booktitle = {Circuits, Logic, and Games, 08.11. - 10.11.2006},
series = {Dagstuhl Seminar Proceedings},
volume = {06451},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2006},
url = {http://drops.dagstuhl.de/opus/volltexte/2007/975},
timestamp = {Thu, 10 Jun 2021 13:02:03 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/WeisI06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BarringtonILST05,
author = {David A. Mix Barrington and
Neil Immerman and
Clemens Lautemann and
Nicole Schweikardt and
Denis Th{\'{e}}rien},
title = {First-order expressibility of languages with neutral letters or: The
Crane Beach conjecture},
journal = {J. Comput. Syst. Sci.},
volume = {70},
number = {2},
pages = {101--127},
year = {2005},
url = {https://doi.org/10.1016/j.jcss.2004.07.004},
doi = {10.1016/J.JCSS.2004.07.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BarringtonILST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/Lev-AmiIRSSY05,
author = {Tal Lev{-}Ami and
Neil Immerman and
Thomas W. Reps and
Shmuel Sagiv and
Siddharth Srivastava and
Greta Yorsh},
editor = {Robert Nieuwenhuis},
title = {Simulating Reachability Using First-Order Logic with Applications
to Verification of Linked Data Structures},
booktitle = {Automated Deduction - CADE-20, 20th International Conference on Automated
Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3632},
pages = {99--115},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11532231\_8},
doi = {10.1007/11532231\_8},
timestamp = {Sun, 02 Oct 2022 15:55:55 +0200},
biburl = {https://dblp.org/rec/conf/cade/Lev-AmiIRSSY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AllenderBISV05,
author = {Eric Allender and
Michael Bauland and
Neil Immerman and
Henning Schnoor and
Heribert Vollmer},
editor = {Joanna Jedrzejowicz and
Andrzej Szepietowski},
title = {The Complexity of Satisfiability Problems: Refining Schaefer's Theorem},
booktitle = {Mathematical Foundations of Computer Science 2005, 30th International
Symposium, {MFCS} 2005, Gdansk, Poland, August 29 - September 2, 2005,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3618},
pages = {71--82},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11549345\_8},
doi = {10.1007/11549345\_8},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AllenderBISV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/ImmermanRRSY04,
author = {Neil Immerman and
Alexander Moshe Rabinovich and
Thomas W. Reps and
Shmuel Sagiv and
Greta Yorsh},
editor = {Rajeev Alur and
Doron A. Peled},
title = {Verification via Structure Simulation},
booktitle = {Computer Aided Verification, 16th International Conference, {CAV}
2004, Boston, MA, USA, July 13-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3114},
pages = {281--294},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27813-9\_22},
doi = {10.1007/978-3-540-27813-9\_22},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/cav/ImmermanRRSY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/ImmermanRRSY04,
author = {Neil Immerman and
Alexander Moshe Rabinovich and
Thomas W. Reps and
Shmuel Sagiv and
Greta Yorsh},
editor = {Jerzy Marcinkowski and
Andrzej Tarlecki},
title = {The Boundary Between Decidability and Undecidability for Transitive-Closure
Logics},
booktitle = {Computer Science Logic, 18th International Workshop, {CSL} 2004, 13th
Annual Conference of the EACSL, Karpacz, Poland, September 20-24,
2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3210},
pages = {160--174},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30124-0\_15},
doi = {10.1007/978-3-540-30124-0\_15},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/ImmermanRRSY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-100,
author = {Eric Allender and
Michael Bauland and
Neil Immerman and
Henning Schnoor and
Heribert Vollmer},
title = {The Complexity of Satisfiability Problems: Refining Schaefer's Theorem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-100}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-100/index.html},
eprinttype = {ECCC},
eprint = {TR04-100},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-100.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/AdlerI03,
author = {Micah Adler and
Neil Immerman},
title = {An \emph{n!} lower bound on formula size},
journal = {{ACM} Trans. Comput. Log.},
volume = {4},
number = {3},
pages = {296--314},
year = {2003},
url = {https://doi.org/10.1145/772062.772064},
doi = {10.1145/772062.772064},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/AdlerI03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/discex/VasudevanDIKT03,
author = {Sudarshan Vasudevan and
Brian DeCleene and
Neil Immerman and
James F. Kurose and
Donald F. Towsley},
title = {Leader Election Algorithms for Wireless Ad Hoc Networks},
booktitle = {3rd {DARPA} Information Survivability Conference and Exposition {(DISCEX-III}
2003), 22-24 April 2003, Washington, DC, {USA}},
pages = {261--272},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/DISCEX.2003.1194890},
doi = {10.1109/DISCEX.2003.1194890},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/discex/VasudevanDIKT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LandauI02,
author = {Susan Landau and
Neil Immerman},
title = {Embedding Linkages on an Integer Lattice},
journal = {Algorithmica},
volume = {32},
number = {3},
pages = {423--436},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0087-6},
doi = {10.1007/S00453-001-0087-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LandauI02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BernsteinGIZ02,
author = {Daniel S. Bernstein and
Robert Givan and
Neil Immerman and
Shlomo Zilberstein},
title = {The Complexity of Decentralized Control of Markov Decision Processes},
journal = {Math. Oper. Res.},
volume = {27},
number = {4},
pages = {819--840},
year = {2002},
url = {https://doi.org/10.1287/moor.27.4.819.297},
doi = {10.1287/MOOR.27.4.819.297},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/BernsteinGIZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/HertzIM02,
author = {Matthew Hertz and
Neil Immerman and
J. Eliot B. Moss},
editor = {Ricardo A. Baeza{-}Yates and
Ugo Montanari and
Nicola Santoro},
title = {Framework for Analyzing Garbage Collection},
booktitle = {Foundations of Information Technology in the Era of Networking and
Mobile Computing, {IFIP} 17\({}^{\mbox{th}}\) World Computer Congress
- {TC1} Stream / 2\({}^{\mbox{nd}}\) {IFIP} International Conference
on Theoretical Computer Science {(TCS} 2002), August 25-30, 2002,
Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
series = {{IFIP} Conference Proceedings},
volume = {223},
pages = {230--242},
publisher = {Kluwer},
year = {2002},
url = {https://doi.org/10.1007/978-0-387-35608-2\_20},
doi = {10.1007/978-0-387-35608-2\_20},
timestamp = {Fri, 27 Sep 2019 10:35:17 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/HertzIM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/HesseI02,
author = {William Hesse and
Neil Immerman},
title = {Complete Problems for Dynamic Complexity Classes},
booktitle = {17th {IEEE} Symposium on Logic in Computer Science {(LICS} 2002),
22-25 July 2002, Copenhagen, Denmark, Proceedings},
pages = {313},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/LICS.2002.1029839},
doi = {10.1109/LICS.2002.1029839},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/HesseI02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bsl/HalpernHIKVV01,
author = {Joseph Y. Halpern and
Robert Harper and
Neil Immerman and
Phokion G. Kolaitis and
Moshe Y. Vardi and
Victor Vianu},
title = {On the unusual effectiveness of logic in computer science},
journal = {Bull. Symb. Log.},
volume = {7},
number = {2},
pages = {213--236},
year = {2001},
url = {https://doi.org/10.2307/2687775},
doi = {10.2307/2687775},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bsl/HalpernHIKVV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/ImmermanBB01,
author = {Neil Immerman and
Jonathan F. Buss and
David A. Mix Barrington},
title = {Number of Variables Is Equivalent to Space},
journal = {J. Symb. Log.},
volume = {66},
number = {3},
pages = {1217--1230},
year = {2001},
url = {https://doi.org/10.2307/2695103},
doi = {10.2307/2695103},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/ImmermanBB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BarringtonILST01,
author = {David A. Mix Barrington and
Neil Immerman and
Clemens Lautemann and
Nicole Schweikardt and
Denis Th{\'{e}}rien},
title = {The Crane Beach Conjecture},
booktitle = {16th Annual {IEEE} Symposium on Logic in Computer Science, Boston,
Massachusetts, USA, June 16-19, 2001, Proceedings},
pages = {187--196},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/LICS.2001.932496},
doi = {10.1109/LICS.2001.932496},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/BarringtonILST01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/AdlerI01,
author = {Micah Adler and
Neil Immerman},
title = {An n! Lower Bound on Formula Size},
booktitle = {16th Annual {IEEE} Symposium on Logic in Computer Science, Boston,
Massachusetts, USA, June 16-19, 2001, Proceedings},
pages = {197--206},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/LICS.2001.932497},
doi = {10.1109/LICS.2001.932497},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/AdlerI01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/ws/phaunRS01/Immerman01,
author = {Neil Immerman},
editor = {Gheorghe Paun and
Grzegorz Rozenberg and
Arto Salomaa},
title = {Progress in Descriptive Complexity},
booktitle = {Current Trends in Theoretical Computer Science, Entering the 21th
Century},
pages = {71--82},
publisher = {World Scientific},
year = {2001},
timestamp = {Sat, 03 Aug 2019 22:52:51 +0200},
biburl = {https://dblp.org/rec/books/ws/phaunRS01/Immerman01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/EtessamiI00,
author = {Kousha Etessami and
Neil Immerman},
title = {Tree Canonization and Transitive Closure},
journal = {Inf. Comput.},
volume = {157},
number = {1-2},
pages = {2--24},
year = {2000},
url = {https://doi.org/10.1006/inco.1999.2835},
doi = {10.1006/INCO.1999.2835},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/EtessamiI00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/igpl/AlechinaI00,
author = {Natasha Alechina and
Neil Immerman},
title = {Reachability Logic: An Efficient Fragment of Transitive Closure Logic},
journal = {Log. J. {IGPL}},
volume = {8},
number = {3},
pages = {325--337},
year = {2000},
url = {https://doi.org/10.1093/jigpal/8.3.325},
doi = {10.1093/JIGPAL/8.3.325},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/igpl/AlechinaI00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uai/BernsteinZI00,
author = {Daniel S. Bernstein and
Shlomo Zilberstein and
Neil Immerman},
editor = {Craig Boutilier and
Mois{\'{e}}s Goldszmidt},
title = {The Complexity of Decentralized Control of Markov Decision Processes},
booktitle = {{UAI} '00: Proceedings of the 16th Conference in Uncertainty in Artificial
Intelligence, Stanford University, Stanford, California, USA, June
30 - July 3, 2000},
pages = {32--37},
publisher = {Morgan Kaufmann},
year = {2000},
url = {https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1\&\#38;smnu=2\&\#38;article\_id=4\&\#38;proceeding\_id=16},
timestamp = {Wed, 03 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/uai/BernsteinZI00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0095988,
author = {Neil Immerman},
title = {Descriptive complexity},
series = {Graduate texts in computer science},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/978-1-4612-0539-5},
doi = {10.1007/978-1-4612-0539-5},
isbn = {978-1-4612-6809-3},
timestamp = {Tue, 16 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0095988.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Immerman99,
author = {Neil Immerman},
title = {Progress in Descriptive Complexity},
journal = {Bull. {EATCS}},
volume = {67},
pages = {72--81},
year = {1999},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/Immerman99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Immerman98,
author = {Neil Immerman},
editor = {Vikraman Arvind and
Ramaswamy Ramanujam},
title = {Descriptive Complexity and Model Checking},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
18th Conference, Chennai, India, December 17-19, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1530},
pages = {1--5},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/978-3-540-49382-2\_1},
doi = {10.1007/978-3-540-49382-2\_1},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Immerman98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PatnaikI97,
author = {Sushant Patnaik and
Neil Immerman},
title = {Dyn-FO: {A} Parallel, Dynamic Complexity Class},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {2},
pages = {199--209},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1520},
doi = {10.1006/JCSS.1997.1520},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/PatnaikI97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AllenderBI97,
author = {Eric Allender and
Jos{\'{e}} L. Balc{\'{a}}zar and
Neil Immerman},
title = {A First-Order Isomorphism Theorem},
journal = {{SIAM} J. Comput.},
volume = {26},
number = {2},
pages = {557--567},
year = {1997},
url = {https://doi.org/10.1137/S0097539794270236},
doi = {10.1137/S0097539794270236},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AllenderBI97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/ImmermanV97,
author = {Neil Immerman and
Moshe Y. Vardi},
editor = {Orna Grumberg},
title = {Model Checking and Transitive-Closure Logic},
booktitle = {Computer Aided Verification, 9th International Conference, {CAV} '97,
Haifa, Israel, June 22-25, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1254},
pages = {291--302},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63166-6\_29},
doi = {10.1007/3-540-63166-6\_29},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/cav/ImmermanV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ImmermanPS96,
author = {Neil Immerman and
Sushant Patnaik and
David W. Stemple},
title = {The Expressiveness of a Family of Finite Set Languages},
journal = {Theor. Comput. Sci.},
volume = {155},
number = {1},
pages = {111--140},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(94)00287-8},
doi = {10.1016/0304-3975(94)00287-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ImmermanPS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/MedinaI96,
author = {J. Antonio Medina and
Neil Immerman},
title = {A Generalization of Fagin's Theorem},
booktitle = {Proceedings, 11th Annual {IEEE} Symposium on Logic in Computer Science,
New Brunswick, New Jersey, USA, July 27-30, 1996},
pages = {2--12},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/LICS.1996.561298},
doi = {10.1109/LICS.1996.561298},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/MedinaI96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dimacs/1996,
editor = {Neil Immerman and
Phokion G. Kolaitis},
title = {Descriptive Complexity and Finite Models, Proceedings of a {DIMACS}
Workshop 1996, Princeton, New Jersey, USA, January 14-17, 1996},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {31},
publisher = {{DIMACS/AMS}},
year = {1996},
url = {https://doi.org/10.1090/dimacs/031},
doi = {10.1090/DIMACS/031},
isbn = {978-0-8218-0517-6},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/1996.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ImmermanL95,
author = {Neil Immerman and
Susan Landau},
title = {The Complexity of Iterated Multiplication},
journal = {Inf. Comput.},
volume = {116},
number = {1},
pages = {103--116},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1007},
doi = {10.1006/INCO.1995.1007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/ImmermanL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EtessamiI95,
author = {Kousha Etessami and
Neil Immerman},
title = {Reachability and the Power of Local Ordering},
journal = {Theor. Comput. Sci.},
volume = {148},
number = {2},
pages = {261--279},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)00034-T},
doi = {10.1016/0304-3975(95)00034-T},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EtessamiI95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/EtessamiI95,
author = {Kousha Etessami and
Neil Immerman},
title = {Tree Canonization and Transitive Closure},
booktitle = {Proceedings, 10th Annual {IEEE} Symposium on Logic in Computer Science,
San Diego, California, USA, June 26-29, 1995},
pages = {331--341},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/LICS.1995.523268},
doi = {10.1109/LICS.1995.523268},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/EtessamiI95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BarringtonI94,
author = {David A. Mix Barrington and
Neil Immerman},
title = {Time, Hardware, and Uniformity},
booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
Amsterdam, The Netherlands, June 28 - July 1, 1994},
pages = {176--185},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SCT.1994.315806},
doi = {10.1109/SCT.1994.315806},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BarringtonI94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/GurevichIS94,
author = {Yuri Gurevich and
Neil Immerman and
Saharon Shelah},
title = {McColm's Conjecture},
booktitle = {Proceedings of the Ninth Annual Symposium on Logic in Computer Science
{(LICS} '94), Paris, France, July 4-7, 1994},
pages = {10--19},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/LICS.1994.316091},
doi = {10.1109/LICS.1994.316091},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/GurevichIS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/MedinaI94,
author = {J. Antonio Medina and
Neil Immerman},
title = {A Syntactic Characterization of NP-Completeness},
booktitle = {Proceedings of the Ninth Annual Symposium on Logic in Computer Science
{(LICS} '94), Paris, France, July 4-7, 1994},
pages = {241--250},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/LICS.1994.316065},
doi = {10.1109/LICS.1994.316065},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/MedinaI94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/PatnaikI94,
author = {Sushant Patnaik and
Neil Immerman},
editor = {Victor Vianu},
title = {Dyn-FO: {A} Parallel, Dynamic Complexity Class},
booktitle = {Proceedings of the Thirteenth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, May 24-26, 1994, Minneapolis, Minnesota,
{USA}},
pages = {210--221},
publisher = {{ACM} Press},
year = {1994},
url = {https://doi.org/10.1145/182591.182614},
doi = {10.1145/182591.182614},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/PatnaikI94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EtessamiI94,
author = {Kousha Etessami and
Neil Immerman},
editor = {Patrice Enjalbert and
Ernst W. Mayr and
Klaus W. Wagner},
title = {Reachability and the Power of Local Ordering},
booktitle = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer
Science, Caen, France, February 24-26, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {775},
pages = {123--135},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57785-8\_136},
doi = {10.1007/3-540-57785-8\_136},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EtessamiI94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GurevichIS94,
author = {Yuri Gurevich and
Neil Immerman and
Saharon Shelah},
title = {McColm conjecture},
journal = {CoRR},
volume = {abs/math/9411235},
year = {1994},
url = {http://arxiv.org/abs/math/9411235},
eprinttype = {arXiv},
eprint = {math/9411235},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GurevichIS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AllenderBI93,
author = {Eric Allender and
Jos{\'{e}} L. Balc{\'{a}}zar and
Neil Immerman},
editor = {Patrice Enjalbert and
Alain Finkel and
Klaus W. Wagner},
title = {A First-Order Isomorphism Theorem},
booktitle = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer
Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {665},
pages = {163--174},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-56503-5\_19},
doi = {10.1007/3-540-56503-5\_19},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AllenderBI93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/CaiFI92,
author = {Jin{-}yi Cai and
Martin F{\"{u}}rer and
Neil Immerman},
title = {An optimal lower bound on the number of variables for graph identification},
journal = {Comb.},
volume = {12},
number = {4},
pages = {389--410},
year = {1992},
url = {https://doi.org/10.1007/BF01305232},
doi = {10.1007/BF01305232},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/CaiFI92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Immerman91,
author = {Neil Immerman},
title = {DSPACE[n\({}^{\mbox{k}}\)] = VAR[k+1]},
booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference,
Chicago, Illinois, USA, June 30 - July 3, 1991},
pages = {334--340},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SCT.1991.160278},
doi = {10.1109/SCT.1991.160278},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Immerman91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/ImmermanPS91,
author = {Neil Immerman and
Sushant Patnaik and
David W. Stemple},
editor = {Daniel J. Rosenkrantz},
title = {The Expressiveness of a Family of Finite Set Languages},
booktitle = {Proceedings of the Tenth {ACM} {SIGACT-SIGMOD-SIGART} Symposium on
Principles of Database Systems, May 29-31, 1991, Denver, Colorado,
{USA}},
pages = {37--52},
publisher = {{ACM} Press},
year = {1991},
url = {https://doi.org/10.1145/113413.113417},
doi = {10.1145/113413.113417},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/ImmermanPS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BarringtonIS90,
author = {David A. Mix Barrington and
Neil Immerman and
Howard Straubing},
title = {On Uniformity within NC{\({^1}\)}},
journal = {J. Comput. Syst. Sci.},
volume = {41},
number = {3},
pages = {274--306},
year = {1990},
url = {https://doi.org/10.1016/0022-0000(90)90022-D},
doi = {10.1016/0022-0000(90)90022-D},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BarringtonIS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ImmermanK89,
author = {Neil Immerman and
Dexter Kozen},
title = {Definability with Bounded Number of Bound Variables},
journal = {Inf. Comput.},
volume = {83},
number = {2},
pages = {121--139},
year = {1989},
url = {https://doi.org/10.1016/0890-5401(89)90055-2},
doi = {10.1016/0890-5401(89)90055-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/ImmermanK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Immerman89,
author = {Neil Immerman},
title = {Expressibility and Parallel Complexity},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {625--638},
year = {1989},
url = {https://doi.org/10.1137/0218043},
doi = {10.1137/0218043},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Immerman89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ImmermanM89,
author = {Neil Immerman and
Stephen R. Mahaney},
title = {Relativizing Relativized Computations},
journal = {Theor. Comput. Sci.},
volume = {68},
number = {3},
pages = {267--276},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90164-3},
doi = {10.1016/0304-3975(89)90164-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ImmermanM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImmermanL89,
author = {Neil Immerman and
Susan Landau},
title = {The Complexity of Iterated Multiplication},
booktitle = {Proceedings: Fourth Annual Structure in Complexity Theory Conference,
University of Oregon, Eugene, Oregon, USA, June 19-22, 1989},
pages = {104--111},
publisher = {{IEEE} Computer Society},
year = {1989},
url = {https://doi.org/10.1109/SCT.1989.41816},
doi = {10.1109/SCT.1989.41816},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ImmermanL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Immerman89,
author = {Neil Immerman},
editor = {J{\'{a}}nos Csirik and
J{\'{a}}nos Demetrovics and
Ferenc G{\'{e}}cseg},
title = {Descriptive and Computational Complexity},
booktitle = {Fundamentals of Computation Theory, International Conference FCT'89,
Szeged, Hungary, August 21-25, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {380},
pages = {244--245},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51498-8\_23},
doi = {10.1007/3-540-51498-8\_23},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/Immerman89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CaiFI89,
author = {Jin{-}yi Cai and
Martin F{\"{u}}rer and
Neil Immerman},
title = {An Optimal Lower Bound on the Number of Variables for Graph Identification},
booktitle = {30th Annual Symposium on Foundations of Computer Science, Research
Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
pages = {612--617},
publisher = {{IEEE} Computer Society},
year = {1989},
url = {https://doi.org/10.1109/SFCS.1989.63543},
doi = {10.1109/SFCS.1989.63543},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CaiFI89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Immerman88,
author = {Neil Immerman},
title = {Nondeterministic Space is Closed Under Complementation},
journal = {{SIAM} J. Comput.},
volume = {17},
number = {5},
pages = {935--938},
year = {1988},
url = {https://doi.org/10.1137/0217058},
doi = {10.1137/0217058},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Immerman88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BarringtonIS88,
author = {David A. Mix Barrington and
Neil Immerman and
Howard Straubing},
title = {On uniformity within NC\({}^{\mbox{1}}\)},
booktitle = {Proceedings: Third Annual Structure in Complexity Theory Conference,
Georgetown University, Washington, D. C., USA, June 14-17, 1988},
pages = {47--59},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SCT.1988.5262},
doi = {10.1109/SCT.1988.5262},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BarringtonIS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Immerman88,
author = {Neil Immerman},
title = {Nondeterministic space is closed under complementation},
booktitle = {Proceedings: Third Annual Structure in Complexity Theory Conference,
Georgetown University, Washington, D. C., USA, June 14-17, 1988},
pages = {112--115},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SCT.1988.5270},
doi = {10.1109/SCT.1988.5270},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Immerman88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FischerI87,
author = {Michael J. Fischer and
Neil Immerman},
title = {Interpreting Logics of Knowledge in Propositional Dynamic Logic with
Converse},
journal = {Inf. Process. Lett.},
volume = {25},
number = {3},
pages = {175--181},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90129-3},
doi = {10.1016/0020-0190(87)90129-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FischerI87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Immerman87,
author = {Neil Immerman},
title = {Languages that Capture Complexity Classes},
journal = {{SIAM} J. Comput.},
volume = {16},
number = {4},
pages = {760--778},
year = {1987},
url = {https://doi.org/10.1137/0216051},
doi = {10.1137/0216051},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Immerman87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Immerman87,
author = {Neil Immerman},
title = {Expressibility as a complexity measure: results and directions},
booktitle = {Proceedings of the Second Annual Conference on Structure in Complexity
Theory, Cornell University, Ithaca, New York, USA, June 16-19, 1987},
pages = {194--202},
publisher = {{IEEE} Computer Society},
year = {1987},
url = {https://ieeexplore.ieee.org/document/10319271},
timestamp = {Tue, 21 Nov 2023 11:59:25 +0100},
biburl = {https://dblp.org/rec/conf/coco/Immerman87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ImmermanK87,
author = {Neil Immerman and
Dexter Kozen},
title = {Definability with Bounded Number of Bound Variables},
booktitle = {Proceedings of the Symposium on Logic in Computer Science {(LICS}
'87), Ithaca, New York, USA, June 22-25, 1987},
pages = {236--244},
publisher = {{IEEE} Computer Society},
year = {1987},
timestamp = {Thu, 22 Jan 2015 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/ImmermanK87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Immerman86,
author = {Neil Immerman},
title = {Relational Queries Computable in Polynomial Time},
journal = {Inf. Control.},
volume = {68},
number = {1-3},
pages = {86--104},
year = {1986},
url = {https://doi.org/10.1016/S0019-9958(86)80029-8},
doi = {10.1016/S0019-9958(86)80029-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Immerman86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tark/FischerI86,
author = {Michael J. Fischer and
Neil Immerman},
editor = {Joseph Y. Halpern},
title = {Foundations of Knowledge for Distributed Systems},
booktitle = {Proceedings of the 1st Conference on Theoretical Aspects of Reasoning
about Knowledge, Monterey, CA, USA, March 1986},
pages = {171--185},
publisher = {Morgan Kaufmann},
year = {1986},
timestamp = {Thu, 21 Jun 2018 07:50:24 +0200},
biburl = {https://dblp.org/rec/conf/tark/FischerI86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HartmanisIS85,
author = {Juris Hartmanis and
Neil Immerman and
Vivian Sewelson},
title = {Sparse Sets in {NP-P:} {EXPTIME} versus {NEXPTIME}},
journal = {Inf. Control.},
volume = {65},
number = {2/3},
pages = {158--181},
year = {1985},
url = {https://doi.org/10.1016/S0019-9958(85)80004-8},
doi = {10.1016/S0019-9958(85)80004-8},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/HartmanisIS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HartmanisI85,
author = {Juris Hartmanis and
Neil Immerman},
editor = {Wilfried Brauer},
title = {On Complete Problems for NP{\textdollar}{\textbackslash}cap{\textdollar}CoNP},
booktitle = {Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece,
July 15-19, 1985, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {194},
pages = {250--259},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/BFb0015750},
doi = {10.1007/BFB0015750},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HartmanisI85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Immerman83,
author = {Neil Immerman},
editor = {David S. Johnson and
Ronald Fagin and
Michael L. Fredman and
David Harel and
Richard M. Karp and
Nancy A. Lynch and
Christos H. Papadimitriou and
Ronald L. Rivest and
Walter L. Ruzzo and
Joel I. Seiferas},
title = {Languages Which Capture Complexity Classes (Preliminary Report)},
booktitle = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
25-27 April, 1983, Boston, Massachusetts, {USA}},
pages = {347--354},
publisher = {{ACM}},
year = {1983},
url = {https://doi.org/10.1145/800061.808765},
doi = {10.1145/800061.808765},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Immerman83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HartmanisSI83,
author = {Juris Hartmanis and
Vivian Sewelson and
Neil Immerman},
editor = {David S. Johnson and
Ronald Fagin and
Michael L. Fredman and
David Harel and
Richard M. Karp and
Nancy A. Lynch and
Christos H. Papadimitriou and
Ronald L. Rivest and
Walter L. Ruzzo and
Joel I. Seiferas},
title = {Sparse Sets in {NP-P:} {EXPTIME} versus {NEXPTIME}},
booktitle = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
25-27 April, 1983, Boston, Massachusetts, {USA}},
pages = {382--391},
publisher = {{ACM}},
year = {1983},
url = {https://doi.org/10.1145/800061.808769},
doi = {10.1145/800061.808769},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HartmanisSI83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Immerman82,
author = {Neil Immerman},
title = {Upper and Lower Bounds for First Order Expressibility},
journal = {J. Comput. Syst. Sci.},
volume = {25},
number = {1},
pages = {76--98},
year = {1982},
url = {https://doi.org/10.1016/0022-0000(82)90011-3},
doi = {10.1016/0022-0000(82)90011-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Immerman82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Immerman82,
author = {Neil Immerman},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Relational Queries Computable in Polynomial Time (Extended Abstract)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {147--152},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802187},
doi = {10.1145/800070.802187},
timestamp = {Wed, 14 Nov 2018 10:51:38 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Immerman82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Immerman81,
author = {Neil Immerman},
title = {Number of Quantifiers is Better Than Number of Tape Cells},
journal = {J. Comput. Syst. Sci.},
volume = {22},
number = {3},
pages = {384--406},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90039-8},
doi = {10.1016/0022-0000(81)90039-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Immerman81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Immerman80,
author = {Neil Immerman},
title = {First Order Expressibility as a New Complexity Measure},
school = {Cornell University, {USA}},
year = {1980},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Immerman80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Immerman80,
author = {Neil Immerman},
title = {Upper and Lower Bounds for First Order Expressibility},
booktitle = {21st Annual Symposium on Foundations of Computer Science, Syracuse,
New York, USA, 13-15 October 1980},
pages = {74--82},
publisher = {{IEEE} Computer Society},
year = {1980},
url = {https://doi.org/10.1109/SFCS.1980.49},
doi = {10.1109/SFCS.1980.49},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Immerman80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Immerman79,
author = {Neil Immerman},
title = {Length of Predicate Calculus Formulas as a New Complexity Measure},
booktitle = {20th Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 29-31 October 1979},
pages = {337--347},
publisher = {{IEEE} Computer Society},
year = {1979},
url = {https://doi.org/10.1109/SFCS.1979.21},
doi = {10.1109/SFCS.1979.21},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Immerman79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HartmanisIM78,
author = {Juris Hartmanis and
Neil Immerman and
Stephen R. Mahaney},
title = {One-Way Log-Tape Reductions},
booktitle = {19th Annual Symposium on Foundations of Computer Science, Ann Arbor,
Michigan, USA, 16-18 October 1978},
pages = {65--72},
publisher = {{IEEE} Computer Society},
year = {1978},
url = {https://doi.org/10.1109/SFCS.1978.31},
doi = {10.1109/SFCS.1978.31},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HartmanisIM78.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-02-27 23:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
