iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.org/pid/47/8037.bib
@article{DBLP:journals/pacmpl/KrishnaLPT24, author = {Shankaranarayanan Krishna and Aniket Lal and Andreas Pavlogiannis and Omkar Tuppe}, title = {On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability}, journal = {Proc. {ACM} Program. Lang.}, volume = {8}, number = {{POPL}}, pages = {1239--1268}, year = {2024}, url = {https://doi.org/10.1145/3632884}, doi = {10.1145/3632884}, timestamp = {Sat, 10 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pacmpl/KrishnaLPT24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/pacmpl/ChakrabortyKMP24, author = {Soham Chakraborty and Shankara Narayanan Krishna and Umang Mathur and Andreas Pavlogiannis}, title = {How Hard Is Weak-Memory Testing?}, journal = {Proc. {ACM} Program. Lang.}, volume = {8}, number = {{POPL}}, pages = {1978--2009}, year = {2024}, url = {https://doi.org/10.1145/3632908}, doi = {10.1145/3632908}, timestamp = {Sat, 10 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pacmpl/ChakrabortyKMP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/apweb/MaEPLK24, author = {Wenyue Ma and Maximilian K. Egger and Andreas Pavlogiannis and Yuchen Li and Panagiotis Karras}, editor = {Wenjie Zhang and Anthony K. H. Tung and Zhonglong Zheng and Zhengyi Yang and Xiaoyang Wang and Hongjie Guo}, title = {Reachability-Aware Fair Influence Maximization}, booktitle = {Web and Big Data - 8th International Joint Conference, APWeb-WAIM 2024, Jinhua, China, August 30 - September 1, 2024, Proceedings, Part {III}}, series = {Lecture Notes in Computer Science}, volume = {14963}, pages = {342--359}, publisher = {Springer}, year = {2024}, url = {https://doi.org/10.1007/978-981-97-7238-4\_22}, doi = {10.1007/978-981-97-7238-4\_22}, timestamp = {Tue, 17 Sep 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/apweb/MaEPLK24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/asplos/TuncDCEP24, author = {H{\"{u}}nkar Can Tun{\c{c}} and Ameya Prashant Deshmukh and Berk {\c{C}}irisci and Constantin Enea and Andreas Pavlogiannis}, editor = {Rajiv Gupta and Nael B. Abu{-}Ghazaleh and Madan Musuvathi and Dan Tsafrir}, title = {CSSTs: {A} Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis}, booktitle = {Proceedings of the 29th {ACM} International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3, {ASPLOS} 2024, La Jolla, CA, USA, 27 April 2024- 1 May 2024}, pages = {223--238}, publisher = {{ACM}}, year = {2024}, url = {https://doi.org/10.1145/3620666.3651358}, doi = {10.1145/3620666.3651358}, timestamp = {Sat, 04 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/asplos/TuncDCEP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/icse/Shi0P24, author = {Zheng Shi and Umang Mathur and Andreas Pavlogiannis}, title = {Optimistic Prediction of Synchronization-Reversal Data Races}, booktitle = {Proceedings of the 46th {IEEE/ACM} International Conference on Software Engineering, {ICSE} 2024, Lisbon, Portugal, April 14-20, 2024}, pages = {134:1--134:13}, publisher = {{ACM}}, year = {2024}, url = {https://doi.org/10.1145/3597503.3639099}, doi = {10.1145/3597503.3639099}, timestamp = {Mon, 09 Dec 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icse/Shi0P24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/ijcai/PetsinisPTK24, author = {Petros Petsinis and Andreas Pavlogiannis and Josef Tkadlec and Panagiotis Karras}, title = {Seed Selection in the Heterogeneous Moran Process}, booktitle = {Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, {IJCAI} 2024, Jeju, South Korea, August 3-9, 2024}, pages = {2297--2305}, publisher = {ijcai.org}, year = {2024}, url = {https://www.ijcai.org/proceedings/2024/254}, timestamp = {Fri, 18 Oct 2024 10:53:17 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/PetsinisPTK24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/ijcai/PetsinisZPZK24, author = {Petros Petsinis and Kaichen Zhang and Andreas Pavlogiannis and Jingbo Zhou and Panagiotis Karras}, title = {Robust Reward Placement under Uncertainty}, booktitle = {Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, {IJCAI} 2024, Jeju, South Korea, August 3-9, 2024}, pages = {6770--6778}, publisher = {ijcai.org}, year = {2024}, url = {https://www.ijcai.org/proceedings/2024/748}, timestamp = {Fri, 18 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/PetsinisZPZK24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/soap-ws/ConradoP24, author = {Giovanna Kobus Conrado and Andreas Pavlogiannis}, editor = {Rapha{\"{e}}l Monat and Cindy Rubio{-}Gonz{\'{a}}lez}, title = {A Better Approximation for Interleaved Dyck Reachability}, booktitle = {Proceedings of the 13th {ACM} {SIGPLAN} International Workshop on the State Of the Art in Program Analysis, {SOAP} 2024, Copenhagen, Denmark, 25 June 2024}, pages = {18--25}, publisher = {{ACM}}, year = {2024}, url = {https://doi.org/10.1145/3652588.3663318}, doi = {10.1145/3652588.3663318}, timestamp = {Thu, 04 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soap-ws/ConradoP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/tacas/JakobsenJPP24, author = {Anna Blume Jakobsen and Rasmus Skibdahl Melanchton J{\o}rgensen and Jaco van de Pol and Andreas Pavlogiannis}, editor = {Bernd Finkbeiner and Laura Kov{\'{a}}cs}, title = {Fast Symbolic Computation of Bottom SCCs}, booktitle = {Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, {TACAS} 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part {III}}, series = {Lecture Notes in Computer Science}, volume = {14572}, pages = {110--128}, publisher = {Springer}, year = {2024}, url = {https://doi.org/10.1007/978-3-031-57256-2\_6}, doi = {10.1007/978-3-031-57256-2\_6}, timestamp = {Sat, 08 Jun 2024 13:13:56 +0200}, biburl = {https://dblp.org/rec/conf/tacas/JakobsenJPP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2401-05642, author = {Zheng Shi and Umang Mathur and Andreas Pavlogiannis}, title = {Optimistic Prediction of Synchronization-Reversal Data Races}, journal = {CoRR}, volume = {abs/2401.05642}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2401.05642}, doi = {10.48550/ARXIV.2401.05642}, eprinttype = {arXiv}, eprint = {2401.05642}, timestamp = {Thu, 25 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2401-05642.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2403-17818, author = {H{\"{u}}nkar Can Tun{\c{c}} and Ameya Prashant Deshmukh and Berk {\c{C}}irisci and Constantin Enea and Andreas Pavlogiannis}, title = {CSSTs: {A} Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis}, journal = {CoRR}, volume = {abs/2403.17818}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2403.17818}, doi = {10.48550/ARXIV.2403.17818}, eprinttype = {arXiv}, eprint = {2403.17818}, timestamp = {Wed, 10 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2403-17818.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2404-15986, author = {Petros Petsinis and Andreas Pavlogiannis and Josef Tkadlec and Panagiotis Karras}, title = {Seed Selection in the Heterogeneous Moran Process}, journal = {CoRR}, volume = {abs/2404.15986}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2404.15986}, doi = {10.48550/ARXIV.2404.15986}, eprinttype = {arXiv}, eprint = {2404.15986}, timestamp = {Mon, 03 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2404-15986.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2405-05433, author = {Petros Petsinis and Kaichen Zhang and Andreas Pavlogiannis and Jingbo Zhou and Panagiotis Karras}, title = {Robust Reward Placement under Uncertainty}, journal = {CoRR}, volume = {abs/2405.05433}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2405.05433}, doi = {10.48550/ARXIV.2405.05433}, eprinttype = {arXiv}, eprint = {2405.05433}, timestamp = {Thu, 13 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2405-05433.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/pacmpl/TuncA0K0P23, author = {H{\"{u}}nkar Can Tun{\c{c}} and Parosh Aziz Abdulla and Soham Chakraborty and Shankaranarayanan Krishna and Umang Mathur and Andreas Pavlogiannis}, title = {Optimal Reads-From Consistency Checking for C11-Style Memory Models}, journal = {Proc. {ACM} Program. Lang.}, volume = {7}, number = {{PLDI}}, pages = {761--785}, year = {2023}, url = {https://doi.org/10.1145/3591251}, doi = {10.1145/3591251}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pacmpl/TuncA0K0P23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/pacmpl/Tunc0P023, author = {H{\"{u}}nkar Can Tun{\c{c}} and Umang Mathur and Andreas Pavlogiannis and Mahesh Viswanathan}, title = {Sound Dynamic Deadlock Prediction in Linear Time}, journal = {Proc. {ACM} Program. Lang.}, volume = {7}, number = {{PLDI}}, pages = {1733--1758}, year = {2023}, url = {https://doi.org/10.1145/3591291}, doi = {10.1145/3591291}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pacmpl/Tunc0P023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/aaai/PetsinisPK23, author = {Petros Petsinis and Andreas Pavlogiannis and Panagiotis Karras}, editor = {Brian Williams and Yiling Chen and Jennifer Neville}, title = {Maximizing the Probability of Fixation in the Positional Voter Model}, booktitle = {Thirty-Seventh {AAAI} Conference on Artificial Intelligence, {AAAI} 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, {IAAI} 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2023, Washington, DC, USA, February 7-14, 2023}, pages = {12269--12277}, publisher = {{AAAI} Press}, year = {2023}, url = {https://doi.org/10.1609/aaai.v37i10.26446}, doi = {10.1609/AAAI.V37I10.26446}, timestamp = {Mon, 04 Sep 2023 12:29:24 +0200}, biburl = {https://dblp.org/rec/conf/aaai/PetsinisPK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/tacas/LarsenSSJPP23, author = {Casper Abild Larsen and Simon Meldahl Schmidt and Jesper Steensgaard and Anna Blume Jakobsen and Jaco van de Pol and Andreas Pavlogiannis}, editor = {Sriram Sankaranarayanan and Natasha Sharygina}, title = {A Truly Symbolic Linear-Time Algorithm for {SCC} Decomposition}, booktitle = {Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, {TACAS} 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2022, Paris, France, April 22-27, 2023, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {13994}, pages = {353--371}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-30820-8\_22}, doi = {10.1007/978-3-031-30820-8\_22}, timestamp = {Sat, 13 May 2023 01:07:18 +0200}, biburl = {https://dblp.org/rec/conf/tacas/LarsenSSJPP23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @misc{DBLP:data/10/TuncACKMP23, author = {H{\"{u}}nkar Can Tun{\c{c}} and Parosh Aziz Abdulla and Soham Chakraborty and Shankaranarayanan Krishna and Umang Mathur and Andreas Pavlogiannis}, title = {Optimal Reads-From Consistency Checking for C11-Style Memory Models (Version 2)}, publisher = {Zenodo}, year = {2023}, month = mar, howpublished = {\url{https://doi.org/10.5281/zenodo.7708693}}, note = {Accessed on YYYY-MM-DD.}, url = {https://doi.org/10.5281/zenodo.7708693}, doi = {10.5281/ZENODO.7708693}, timestamp = {Mon, 04 Nov 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/data/10/TuncACKMP23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @misc{DBLP:data/10/TuncACKMP23a, author = {H{\"{u}}nkar Can Tun{\c{c}} and Parosh Aziz Abdulla and Soham Chakraborty and Shankaranarayanan Krishna and Umang Mathur and Andreas Pavlogiannis}, title = {Optimal Reads-From Consistency Checking for C11-Style Memory Models (Version 5)}, publisher = {Zenodo}, year = {2023}, month = mar, howpublished = {\url{https://doi.org/10.5281/zenodo.7816526}}, note = {Accessed on YYYY-MM-DD.}, url = {https://doi.org/10.5281/zenodo.7816526}, doi = {10.5281/ZENODO.7816526}, timestamp = {Tue, 05 Nov 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/data/10/TuncACKMP23a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @misc{DBLP:data/10/TuncMPV23, author = {H{\"{u}}nkar Can Tun{\c{c}} and Umang Mathur and Andreas Pavlogiannis and Mahesh Viswanathan}, title = {Sound Dynamic Deadlock Prediction in Linear Time (Version 5)}, publisher = {Zenodo}, year = {2023}, month = mar, howpublished = {\url{https://doi.org/10.5281/zenodo.7809600}}, note = {Accessed on YYYY-MM-DD.}, url = {https://doi.org/10.5281/zenodo.7809600}, doi = {10.5281/ZENODO.7809600}, timestamp = {Tue, 05 Nov 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/data/10/TuncMPV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2304-03692, author = {Umang Mathur and Andreas Pavlogiannis and H{\"{u}}nkar Can Tun{\c{c}} and Mahesh Viswanathan}, title = {Sound Dynamic Deadlock Prediction in Linear Time}, journal = {CoRR}, volume = {abs/2304.03692}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2304.03692}, doi = {10.48550/ARXIV.2304.03692}, eprinttype = {arXiv}, eprint = {2304.03692}, timestamp = {Tue, 18 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2304-03692.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2304-03714, author = {Parosh Aziz Abdulla and Soham Chakraborty and Shankaranarayanan Krishna and Umang Mathur and Andreas Pavlogiannis and H{\"{u}}nkar Can Tun{\c{c}}}, title = {Optimal Reads-From Consistency Checking for C11-Style Memory Models}, journal = {CoRR}, volume = {abs/2304.03714}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2304.03714}, doi = {10.48550/ARXIV.2304.03714}, eprinttype = {arXiv}, eprint = {2304.03714}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2304-03714.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2311-04302, author = {Soham Chakraborty and Shankaranarayanan Krishna and Umang Mathur and Andreas Pavlogiannis}, title = {How Hard is Weak-Memory Testing?}, journal = {CoRR}, volume = {abs/2311.04302}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2311.04302}, doi = {10.48550/ARXIV.2311.04302}, eprinttype = {arXiv}, eprint = {2311.04302}, timestamp = {Tue, 14 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2311-04302.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2311-04319, author = {Shankaranarayanan Krishna and Aniket Lal and Andreas Pavlogiannis and Omkar Tuppe}, title = {On-The-Fly Static Analysis via Dynamic Bidirected Dyck Reachability}, journal = {CoRR}, volume = {abs/2311.04319}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2311.04319}, doi = {10.48550/ARXIV.2311.04319}, eprinttype = {arXiv}, eprint = {2311.04319}, timestamp = {Tue, 14 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2311-04319.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/pacmpl/KjelstromP22, author = {Adam Husted Kjelstr{\o}m and Andreas Pavlogiannis}, title = {The decidability and complexity of interleaved bidirected Dyck reachability}, journal = {Proc. {ACM} Program. Lang.}, volume = {6}, number = {{POPL}}, pages = {1--26}, year = {2022}, url = {https://doi.org/10.1145/3498673}, doi = {10.1145/3498673}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pacmpl/KjelstromP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/siglog/Pavlogiannis22, author = {Andreas Pavlogiannis}, title = {CFL/Dyck Reachability: An Algorithmic Perspective}, journal = {{ACM} {SIGLOG} News}, volume = {9}, number = {4}, pages = {5--25}, year = {2022}, url = {https://doi.org/10.1145/3583660.3583664}, doi = {10.1145/3583660.3583664}, timestamp = {Sun, 26 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siglog/Pavlogiannis22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/aaai/BrendborgKPRT22, author = {Joachim Brendborg and Panagiotis Karras and Andreas Pavlogiannis and Asger Ullersted Rasmussen and Josef Tkadlec}, title = {Fixation Maximization in the Positional Moran Process}, booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI} 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22 - March 1, 2022}, pages = {9304--9312}, publisher = {{AAAI} Press}, year = {2022}, url = {https://doi.org/10.1609/aaai.v36i9.21160}, doi = {10.1609/AAAI.V36I9.21160}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/aaai/BrendborgKPRT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/asplos/0001PT022, author = {Umang Mathur and Andreas Pavlogiannis and H{\"{u}}nkar Can Tun{\c{c}} and Mahesh Viswanathan}, editor = {Babak Falsafi and Michael Ferdman and Shan Lu and Thomas F. Wenisch}, title = {A tree clock data structure for causal orderings in concurrent executions}, booktitle = {{ASPLOS} '22: 27th {ACM} International Conference on Architectural Support for Programming Languages and Operating Systems, Lausanne, Switzerland, 28 February 2022 - 4 March 2022}, pages = {710--725}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3503222.3507734}, doi = {10.1145/3503222.3507734}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/asplos/0001PT022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/icalp/GanardiMPSZ22, author = {Moses Ganardi and Rupak Majumdar and Andreas Pavlogiannis and Lia Sch{\"{u}}tze and Georg Zetzsche}, editor = {Mikolaj Bojanczyk and Emanuela Merelli and David P. Woodruff}, title = {Reachability in Bidirected Pushdown {VASS}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming, {ICALP} 2022, July 4-8, 2022, Paris, France}, series = {LIPIcs}, volume = {229}, pages = {124:1--124:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.124}, doi = {10.4230/LIPICS.ICALP.2022.124}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/GanardiMPSZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/ijcai/DurocherKPT22, author = {Loke Durocher and Panagiotis Karras and Andreas Pavlogiannis and Josef Tkadlec}, editor = {Luc De Raedt}, title = {Invasion Dynamics in the Biased Voter Process}, booktitle = {Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, {IJCAI} 2022, Vienna, Austria, 23-29 July 2022}, pages = {265--271}, publisher = {ijcai.org}, year = {2022}, url = {https://doi.org/10.24963/ijcai.2022/38}, doi = {10.24963/IJCAI.2022/38}, timestamp = {Tue, 15 Oct 2024 16:43:28 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/DurocherKPT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/pldi/AhmadiDGP22, author = {Ali Ahmadi and Majid Daliri and Amir Kafshdar Goharshady and Andreas Pavlogiannis}, editor = {Ranjit Jhala and Isil Dillig}, title = {Efficient approximations for cache-conscious data placement}, booktitle = {{PLDI} '22: 43rd {ACM} {SIGPLAN} International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13 - 17, 2022}, pages = {857--871}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519939.3523436}, doi = {10.1145/3519939.3523436}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/pldi/AhmadiDGP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/sigsoft/0001P22, author = {Umang Mathur and Andreas Pavlogiannis}, editor = {Abhik Roychoudhury and Cristian Cadar and Miryung Kim}, title = {Dynamic data race prediction: fundamentals, theory, and practice (tutorial)}, booktitle = {Proceedings of the 30th {ACM} Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, {ESEC/FSE} 2022, Singapore, Singapore, November 14-18, 2022}, pages = {1820}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3540250.3569450}, doi = {10.1145/3540250.3569450}, timestamp = {Thu, 10 Nov 2022 11:14:54 +0100}, biburl = {https://dblp.org/rec/conf/sigsoft/0001P22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2201-02248, author = {Joachim Brendborg and Panagiotis Karras and Andreas Pavlogiannis and Asger Ullersted Rasmussen and Josef Tkadlec}, title = {Fixation Maximization in the Positional Moran Process}, journal = {CoRR}, volume = {abs/2201.02248}, year = {2022}, url = {https://arxiv.org/abs/2201.02248}, eprinttype = {arXiv}, eprint = {2201.02248}, timestamp = {Mon, 10 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2201-02248.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2201-06325, author = {Umang Mathur and Andreas Pavlogiannis and H{\"{u}}nkar Can Tun{\c{c}} and Mahesh Viswanathan}, title = {A Tree Clock Data Structure for Causal Orderings in Concurrent Executions}, journal = {CoRR}, volume = {abs/2201.06325}, year = {2022}, url = {https://arxiv.org/abs/2201.06325}, eprinttype = {arXiv}, eprint = {2201.06325}, timestamp = {Fri, 21 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2201-06325.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2201-08207, author = {Loke Durocher and Panagiotis Karras and Andreas Pavlogiannis and Josef Tkadlec}, title = {Invasion Dynamics in the Biased Voter Process}, journal = {CoRR}, volume = {abs/2201.08207}, year = {2022}, url = {https://arxiv.org/abs/2201.08207}, eprinttype = {arXiv}, eprint = {2201.08207}, timestamp = {Wed, 02 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2201-08207.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2204-11799, author = {Moses Ganardi and Rupak Majumdar and Andreas Pavlogiannis and Lia Sch{\"{u}}tze and Georg Zetzsche}, title = {Reachability in Bidirected Pushdown {VASS}}, journal = {CoRR}, volume = {abs/2204.11799}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2204.11799}, doi = {10.48550/ARXIV.2204.11799}, eprinttype = {arXiv}, eprint = {2204.11799}, timestamp = {Thu, 28 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2204-11799.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2210-02394, author = {Krishnendu Chatterjee and Jakub Svoboda and Dorde Zikelic and Andreas Pavlogiannis and Josef Tkadlec}, title = {Social Balance on Networks: Local Minima and Best Edge Dynamics}, journal = {CoRR}, volume = {abs/2210.02394}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2210.02394}, doi = {10.48550/ARXIV.2210.02394}, eprinttype = {arXiv}, eprint = {2210.02394}, timestamp = {Fri, 07 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2210-02394.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2211-14676, author = {Petros Petsinis and Andreas Pavlogiannis and Panagiotis Karras}, title = {Maximizing the Probability of Fixation in the Positional Voter Model}, journal = {CoRR}, volume = {abs/2211.14676}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2211.14676}, doi = {10.48550/ARXIV.2211.14676}, eprinttype = {arXiv}, eprint = {2211.14676}, timestamp = {Wed, 30 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2211-14676.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/fmsd/ChatterjeeIP21, author = {Krishnendu Chatterjee and Rasmus Ibsen{-}Jensen and Andreas Pavlogiannis}, title = {Faster algorithms for quantitative verification in bounded treewidth graphs}, journal = {Formal Methods Syst. Des.}, volume = {57}, number = {3}, pages = {401--428}, year = {2021}, url = {https://doi.org/10.1007/s10703-021-00373-5}, doi = {10.1007/S10703-021-00373-5}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/fmsd/ChatterjeeIP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/ipl/HansenKP21, author = {Jakob Cetti Hansen and Adam Husted Kjelstr{\o}m and Andreas Pavlogiannis}, title = {Tight bounds for reachability problems on one-counter and pushdown systems}, journal = {Inf. Process. Lett.}, volume = {171}, pages = {106135}, year = {2021}, url = {https://doi.org/10.1016/j.ipl.2021.106135}, doi = {10.1016/J.IPL.2021.106135}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HansenKP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/pacmpl/BuiCGPT21, author = {Truc Lam Bui and Krishnendu Chatterjee and Tushar Gautam and Andreas Pavlogiannis and Viktor Toman}, title = {The reads-from equivalence for the {TSO} and {PSO} memory models}, journal = {Proc. {ACM} Program. Lang.}, volume = {5}, number = {{OOPSLA}}, pages = {1--30}, year = {2021}, url = {https://doi.org/10.1145/3485541}, doi = {10.1145/3485541}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pacmpl/BuiCGPT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/pacmpl/0001P021, author = {Umang Mathur and Andreas Pavlogiannis and Mahesh Viswanathan}, title = {Optimal prediction of synchronization-preserving races}, journal = {Proc. {ACM} Program. Lang.}, volume = {5}, number = {{POPL}}, pages = {1--29}, year = {2021}, url = {https://doi.org/10.1145/3434317}, doi = {10.1145/3434317}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pacmpl/0001P021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/pacmpl/MathiasenP21, author = {Anders Alnor Mathiasen and Andreas Pavlogiannis}, title = {The fine-grained and parallel complexity of andersen's pointer analysis}, journal = {Proc. {ACM} Program. Lang.}, volume = {5}, number = {{POPL}}, pages = {1--29}, year = {2021}, url = {https://doi.org/10.1145/3434315}, doi = {10.1145/3434315}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pacmpl/MathiasenP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/cav/AgarwalCPPT21, author = {Pratyush Agarwal and Krishnendu Chatterjee and Shreya Pathak and Andreas Pavlogiannis and Viktor Toman}, editor = {Alexandra Silva and K. Rustan M. Leino}, title = {Stateless Model Checking Under a Reads-Value-From Equivalence}, 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 = {341--366}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-81685-8\_16}, doi = {10.1007/978-3-030-81685-8\_16}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cav/AgarwalCPPT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/concur/Kulkarni0P21, author = {Rucha Kulkarni and Umang Mathur and Andreas Pavlogiannis}, editor = {Serge Haddad and Daniele Varacca}, title = {Dynamic Data-Race Detection Through the Fine-Grained Lens}, booktitle = {32nd International Conference on Concurrency Theory, {CONCUR} 2021, August 24-27, 2021, Virtual Conference}, series = {LIPIcs}, volume = {203}, pages = {16:1--16:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.CONCUR.2021.16}, doi = {10.4230/LIPICS.CONCUR.2021.16}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/concur/Kulkarni0P21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/fsttcs/ChatterjeeIP21, author = {Krishnendu Chatterjee and Rasmus Ibsen{-}Jensen and Andreas Pavlogiannis}, editor = {Mikolaj Bojanczyk and Chandra Chekuri}, title = {Quantitative Verification on Product Graphs of Small Treewidth}, booktitle = {41st {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2021, December 15-17, 2021, Virtual Conference}, series = {LIPIcs}, volume = {213}, pages = {42:1--42:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42}, doi = {10.4230/LIPICS.FSTTCS.2021.42}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/ChatterjeeIP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2105-06424, author = {Pratyush Agarwal and Krishnendu Chatterjee and Shreya Pathak and Andreas Pavlogiannis and Viktor Toman}, title = {Stateless Model Checking under a Reads-Value-From Equivalence}, journal = {CoRR}, volume = {abs/2105.06424}, year = {2021}, url = {https://arxiv.org/abs/2105.06424}, eprinttype = {arXiv}, eprint = {2105.06424}, timestamp = {Tue, 18 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2105-06424.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2107-03569, author = {Rucha Kulkarni and Umang Mathur and Andreas Pavlogiannis}, title = {Dynamic Data-Race Detection through the Fine-Grained Lens}, journal = {CoRR}, volume = {abs/2107.03569}, year = {2021}, url = {https://arxiv.org/abs/2107.03569}, eprinttype = {arXiv}, eprint = {2107.03569}, timestamp = {Tue, 20 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-03569.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2111-05923, author = {Adam Husted Kjelstr{\o}m and Andreas Pavlogiannis}, title = {The Decidability and Complexity of Interleaved Bidirected Dyck Reachability}, journal = {CoRR}, volume = {abs/2111.05923}, year = {2021}, url = {https://arxiv.org/abs/2111.05923}, eprinttype = {arXiv}, eprint = {2111.05923}, timestamp = {Tue, 16 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-05923.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/pacmpl/Pavlogiannis20, author = {Andreas Pavlogiannis}, title = {Fast, sound, and effectively complete dynamic race prediction}, journal = {Proc. {ACM} Program. Lang.}, volume = {4}, number = {{POPL}}, pages = {17:1--17:29}, year = {2020}, url = {https://doi.org/10.1145/3371085}, doi = {10.1145/3371085}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pacmpl/Pavlogiannis20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/ploscb/TkadlecPCN20, author = {Josef Tkadlec and Andreas Pavlogiannis and Krishnendu Chatterjee and Martin A. Nowak}, title = {Limits on amplifiers of natural selection under death-Birth updating}, journal = {PLoS Comput. Biol.}, volume = {16}, number = {1}, year = {2020}, url = {https://doi.org/10.1371/journal.pcbi.1007494}, doi = {10.1371/JOURNAL.PCBI.1007494}, timestamp = {Thu, 10 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ploscb/TkadlecPCN20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/tcad/PavlogiannisSSC20, author = {Andreas Pavlogiannis and Nico Schaumberger and Ulrich Schmid and Krishnendu Chatterjee}, title = {Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling}, journal = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.}, volume = {39}, number = {11}, pages = {3981--3992}, year = {2020}, url = {https://doi.org/10.1109/TCAD.2020.3012803}, doi = {10.1109/TCAD.2020.3012803}, timestamp = {Thu, 17 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcad/PavlogiannisSSC20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/atva/AsadiCGMP20, author = {Ali Asadi and Krishnendu Chatterjee and Amir Kafshdar Goharshady and Kiarash Mohammadi and Andreas Pavlogiannis}, editor = {Dang Van Hung and Oleg Sokolsky}, title = {Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth}, booktitle = {Automated Technology for Verification and Analysis - 18th International Symposium, {ATVA} 2020, Hanoi, Vietnam, October 19-23, 2020, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12302}, pages = {253--270}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-59152-6\_14}, doi = {10.1007/978-3-030-59152-6\_14}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/atva/AsadiCGMP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/esop/ChatterjeeGIP20, author = {Krishnendu Chatterjee and Amir Kafshdar Goharshady and Rasmus Ibsen{-}Jensen and Andreas Pavlogiannis}, editor = {Peter M{\"{u}}ller}, title = {Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis}, booktitle = {Programming Languages and Systems - 29th European Symposium on Programming, {ESOP} 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2020, Dublin, Ireland, April 25-30, 2020, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12075}, pages = {112--140}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-44914-8\_5}, doi = {10.1007/978-3-030-44914-8\_5}, timestamp = {Fri, 14 May 2021 08:34:21 +0200}, biburl = {https://dblp.org/rec/conf/esop/ChatterjeeGIP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/lics/0001P020, author = {Umang Mathur and Andreas Pavlogiannis and Mahesh Viswanathan}, editor = {Holger Hermanns and Lijun Zhang and Naoki Kobayashi and Dale Miller}, title = {The Complexity of Dynamic Data Race Prediction}, booktitle = {{LICS} '20: 35th Annual {ACM/IEEE} Symposium on Logic in Computer Science, Saarbr{\"{u}}cken, Germany, July 8-11, 2020}, pages = {713--727}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3373718.3394783}, doi = {10.1145/3373718.3394783}, timestamp = {Sat, 30 Sep 2023 09:52:07 +0200}, biburl = {https://dblp.org/rec/conf/lics/0001P020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2001-11070, author = {Krishnendu Chatterjee and Amir Kafshdar Goharshady and Rasmus Ibsen{-}Jensen and Andreas Pavlogiannis}, title = {Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis}, journal = {CoRR}, volume = {abs/2001.11070}, year = {2020}, url = {https://arxiv.org/abs/2001.11070}, eprinttype = {arXiv}, eprint = {2001.11070}, timestamp = {Mon, 03 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2001-11070.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2004-08828, author = {Ali Asadi and Krishnendu Chatterjee and Amir Kafshdar Goharshady and Kiarash Mohammadi and Andreas Pavlogiannis}, title = {Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth}, journal = {CoRR}, volume = {abs/2004.08828}, year = {2020}, url = {https://arxiv.org/abs/2004.08828}, eprinttype = {arXiv}, eprint = {2004.08828}, timestamp = {Wed, 22 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2004-08828.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2004-14931, author = {Umang Mathur and Andreas Pavlogiannis and Mahesh Viswanathan}, title = {The Complexity of Dynamic Data Race Prediction}, journal = {CoRR}, volume = {abs/2004.14931}, year = {2020}, url = {https://arxiv.org/abs/2004.14931}, eprinttype = {arXiv}, eprint = {2004.14931}, timestamp = {Fri, 22 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2004-14931.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2006-01491, author = {Andreas Pavlogiannis}, title = {The Fine-Grained Complexity of Andersen's Pointer Analysis}, journal = {CoRR}, volume = {abs/2006.01491}, year = {2020}, url = {https://arxiv.org/abs/2006.01491}, eprinttype = {arXiv}, eprint = {2006.01491}, timestamp = {Sat, 23 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2006-01491.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2010-16385, author = {Umang Mathur and Andreas Pavlogiannis and Mahesh Viswanathan}, title = {Optimal Prediction of Synchronization-Preserving Races}, journal = {CoRR}, volume = {abs/2010.16385}, year = {2020}, url = {https://arxiv.org/abs/2010.16385}, eprinttype = {arXiv}, eprint = {2010.16385}, timestamp = {Tue, 03 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2010-16385.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-2011-11763, author = {Truc Lam Bui and Krishnendu Chatterjee and Tushar Gautam and Andreas Pavlogiannis and Viktor Toman}, title = {The Reads-From Equivalence for the {TSO} and {PSO} Memory Models}, journal = {CoRR}, volume = {abs/2011.11763}, year = {2020}, url = {https://arxiv.org/abs/2011.11763}, eprinttype = {arXiv}, eprint = {2011.11763}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2011-11763.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/pacmpl/ChatterjeePT19, author = {Krishnendu Chatterjee and Andreas Pavlogiannis and Viktor Toman}, title = {Value-centric dynamic partial order reduction}, journal = {Proc. {ACM} Program. Lang.}, volume = {3}, number = {{OOPSLA}}, pages = {124:1--124:29}, year = {2019}, url = {https://doi.org/10.1145/3360550}, doi = {10.1145/3360550}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pacmpl/ChatterjeePT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/pacmpl/ChatterjeeGOP19, author = {Krishnendu Chatterjee and Amir Kafshdar Goharshady and Nastaran Okati and Andreas Pavlogiannis}, title = {Efficient parameterized algorithms for data packing}, journal = {Proc. {ACM} Program. Lang.}, volume = {3}, number = {{POPL}}, pages = {53:1--53:28}, year = {2019}, url = {https://doi.org/10.1145/3290366}, doi = {10.1145/3290366}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pacmpl/ChatterjeeGOP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/toplas/ChatterjeeGGIP19, author = {Krishnendu Chatterjee and Amir Kafshdar Goharshady and Prateesh Goyal and Rasmus Ibsen{-}Jensen and Andreas Pavlogiannis}, title = {Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth}, journal = {{ACM} Trans. Program. Lang. Syst.}, volume = {41}, number = {4}, pages = {23:1--23:46}, year = {2019}, url = {https://doi.org/10.1145/3363525}, doi = {10.1145/3363525}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toplas/ChatterjeeGGIP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-1901-08857, author = {Andreas Pavlogiannis}, title = {Fast, Sound and Effectively Complete Dynamic Race Detection}, journal = {CoRR}, volume = {abs/1901.08857}, year = {2019}, url = {http://arxiv.org/abs/1901.08857}, eprinttype = {arXiv}, eprint = {1901.08857}, timestamp = {Sat, 02 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1901-08857.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-1909-00989, author = {Krishnendu Chatterjee and Andreas Pavlogiannis and Viktor Toman}, title = {Value-centric Dynamic Partial Order Reduction}, journal = {CoRR}, volume = {abs/1909.00989}, year = {2019}, url = {http://arxiv.org/abs/1909.00989}, eprinttype = {arXiv}, eprint = {1909.00989}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1909-00989.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-1910-00241, author = {Krishnendu Chatterjee and Bhavya Choudhary and Andreas Pavlogiannis}, title = {Optimal Dyck Reachability for Data-Dependence and Alias Analysis}, journal = {CoRR}, volume = {abs/1910.00241}, year = {2019}, url = {http://arxiv.org/abs/1910.00241}, eprinttype = {arXiv}, eprint = {1910.00241}, timestamp = {Fri, 04 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1910-00241.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/pacmpl/ChatterjeeCP18, author = {Krishnendu Chatterjee and Bhavya Choudhary and Andreas Pavlogiannis}, title = {Optimal Dyck reachability for data-dependence and alias analysis}, journal = {Proc. {ACM} Program. Lang.}, volume = {2}, number = {{POPL}}, pages = {30:1--30:30}, year = {2018}, url = {https://doi.org/10.1145/3158118}, doi = {10.1145/3158118}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pacmpl/ChatterjeeCP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/pacmpl/ChalupaCPSV18, author = {Marek Chalupa and Krishnendu Chatterjee and Andreas Pavlogiannis and Nishant Sinha and Kapil Vaidya}, title = {Data-centric dynamic partial order reduction}, journal = {Proc. {ACM} Program. Lang.}, volume = {2}, number = {{POPL}}, pages = {31:1--31:30}, year = {2018}, url = {https://doi.org/10.1145/3158119}, doi = {10.1145/3158119}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pacmpl/ChalupaCPSV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/rts/ChatterjeePKS18, author = {Krishnendu Chatterjee and Andreas Pavlogiannis and Alexander K{\"{o}}{\ss}ler and Ulrich Schmid}, title = {Automated competitive analysis of real-time scheduling with graph games}, journal = {Real Time Syst.}, volume = {54}, number = {1}, pages = {166--207}, year = {2018}, url = {https://doi.org/10.1007/s11241-017-9293-4}, doi = {10.1007/S11241-017-9293-4}, timestamp = {Thu, 10 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rts/ChatterjeePKS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/toplas/ChatterjeeIGP18, author = {Krishnendu Chatterjee and Rasmus Ibsen{-}Jensen and Amir Kafshdar Goharshady and Andreas Pavlogiannis}, title = {Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components}, journal = {{ACM} Trans. Program. Lang. Syst.}, volume = {40}, number = {3}, pages = {9:1--9:43}, year = {2018}, url = {https://doi.org/10.1145/3210257}, doi = {10.1145/3210257}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toplas/ChatterjeeIGP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-1802-02509, author = {Andreas Pavlogiannis and Josef Tkadlec and Krishnendu Chatterjee and Martin A. Nowak}, title = {Strong Amplifiers of Natural Selection: Proofs}, journal = {CoRR}, volume = {abs/1802.02509}, year = {2018}, url = {http://arxiv.org/abs/1802.02509}, eprinttype = {arXiv}, eprint = {1802.02509}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1802-02509.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-1810-02687, author = {Josef Tkadlec and Andreas Pavlogiannis and Krishnendu Chatterjee and Martin A. Nowak}, title = {Fixation probability and fixation time in structured populations}, journal = {CoRR}, volume = {abs/1810.02687}, year = {2018}, url = {http://arxiv.org/abs/1810.02687}, eprinttype = {arXiv}, eprint = {1810.02687}, timestamp = {Thu, 01 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1810-02687.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/atva/ChatterjeeGP17, author = {Krishnendu Chatterjee and Amir Kafshdar Goharshady and Andreas Pavlogiannis}, editor = {Deepak D'Souza and K. Narayan Kumar}, title = {JTDec: {A} Tool for Tree Decompositions in Soot}, booktitle = {Automated Technology for Verification and Analysis - 15th International Symposium, {ATVA} 2017, Pune, India, October 3-6, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10482}, pages = {59--66}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68167-2\_4}, doi = {10.1007/978-3-319-68167-2\_4}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/atva/ChatterjeeGP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/esop/ChatterjeeKMP17, author = {Krishnendu Chatterjee and Bernhard Kragl and Samarth Mishra and Andreas Pavlogiannis}, editor = {Hongseok Yang}, title = {Faster Algorithms for Weighted Recursive State Machines}, booktitle = {Programming Languages and Systems - 26th European Symposium on Programming, {ESOP} 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10201}, pages = {287--313}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-662-54434-1\_11}, doi = {10.1007/978-3-662-54434-1\_11}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/esop/ChatterjeeKMP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/ChatterjeeKMP17, author = {Krishnendu Chatterjee and Bernhard Kragl and Samarth Mishra and Andreas Pavlogiannis}, title = {Faster Algorithms for Weighted Recursive State Machines}, journal = {CoRR}, volume = {abs/1701.04914}, year = {2017}, url = {http://arxiv.org/abs/1701.04914}, eprinttype = {arXiv}, eprint = {1701.04914}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChatterjeeKMP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/esa/ChatterjeeIP16, author = {Krishnendu Chatterjee and Rasmus Ibsen{-}Jensen and Andreas Pavlogiannis}, editor = {Piotr Sankowski and Christos D. Zaroliagis}, title = {Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs}, booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24, 2016, Aarhus, Denmark}, series = {LIPIcs}, volume = {57}, pages = {28:1--28:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ESA.2016.28}, doi = {10.4230/LIPICS.ESA.2016.28}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/esa/ChatterjeeIP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/popl/ChatterjeeGIP16, author = {Krishnendu Chatterjee and Amir Kafshdar Goharshady and Rasmus Ibsen{-}Jensen and Andreas Pavlogiannis}, editor = {Rastislav Bod{\'{\i}}k and Rupak Majumdar}, title = {Algorithms for algebraic path properties in concurrent systems of constant treewidth components}, 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 = {733--747}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2837614.2837624}, doi = {10.1145/2837614.2837624}, timestamp = {Wed, 23 Jun 2021 15:34:31 +0200}, biburl = {https://dblp.org/rec/conf/popl/ChatterjeeGIP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/ChatterjeePSV16, author = {Krishnendu Chatterjee and Andreas Pavlogiannis and Nishant Sinha and Kapil Vaidya}, title = {Data-centric Dynamic Partial Order Reduction}, journal = {CoRR}, volume = {abs/1610.01188}, year = {2016}, url = {http://arxiv.org/abs/1610.01188}, eprinttype = {arXiv}, eprint = {1610.01188}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChatterjeePSV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/cav/ChatterjeeIP15, author = {Krishnendu Chatterjee and Rasmus Ibsen{-}Jensen and Andreas Pavlogiannis}, editor = {Daniel Kroening and Corina S. Pasareanu}, title = {Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs}, booktitle = {Computer Aided Verification - 27th International Conference, {CAV} 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {9206}, pages = {140--157}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-21690-4\_9}, doi = {10.1007/978-3-319-21690-4\_9}, timestamp = {Fri, 27 Mar 2020 08:45:57 +0100}, biburl = {https://dblp.org/rec/conf/cav/ChatterjeeIP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/popl/ChatterjeeIPG15, author = {Krishnendu Chatterjee and Rasmus Ibsen{-}Jensen and Andreas Pavlogiannis and Prateesh Goyal}, editor = {Sriram K. Rajamani and David Walker}, title = {Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth}, booktitle = {Proceedings of the 42nd Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} 2015, Mumbai, India, January 15-17, 2015}, pages = {97--109}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2676726.2676979}, doi = {10.1145/2676726.2676979}, timestamp = {Mon, 08 Apr 2024 08:19:10 +0200}, biburl = {https://dblp.org/rec/conf/popl/ChatterjeeIPG15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/popl/ChatterjeePV15, author = {Krishnendu Chatterjee and Andreas Pavlogiannis and Yaron Velner}, editor = {Sriram K. Rajamani and David Walker}, title = {Quantitative Interprocedural Analysis}, booktitle = {Proceedings of the 42nd Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} 2015, Mumbai, India, January 15-17, 2015}, pages = {539--551}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2676726.2676968}, doi = {10.1145/2676726.2676968}, timestamp = {Wed, 23 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/popl/ChatterjeePV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/ChatterjeeIP15, author = {Krishnendu Chatterjee and Rasmus Ibsen{-}Jensen and Andreas Pavlogiannis}, title = {Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs}, journal = {CoRR}, volume = {abs/1504.07384}, year = {2015}, url = {http://arxiv.org/abs/1504.07384}, eprinttype = {arXiv}, eprint = {1504.07384}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChatterjeeIP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/ChatterjeeGIP15, author = {Krishnendu Chatterjee and Amir Kafshdar Goharshady and Rasmus Ibsen{-}Jensen and Andreas Pavlogiannis}, title = {Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components}, journal = {CoRR}, volume = {abs/1510.07565}, year = {2015}, url = {http://arxiv.org/abs/1510.07565}, eprinttype = {arXiv}, eprint = {1510.07565}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChatterjeeGIP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/ploscb/ChatterjeePAN14, author = {Krishnendu Chatterjee and Andreas Pavlogiannis and Ben Adlam and Martin A. Nowak}, title = {The Time Scale of Evolutionary Innovation}, journal = {PLoS Comput. Biol.}, volume = {10}, number = {9}, year = {2014}, url = {https://doi.org/10.1371/journal.pcbi.1003818}, doi = {10.1371/JOURNAL.PCBI.1003818}, timestamp = {Thu, 10 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ploscb/ChatterjeePAN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/rtss/ChatterjeePKS14, author = {Krishnendu Chatterjee and Andreas Pavlogiannis and Alexander K{\"{o}}{\ss}ler and Ulrich Schmid}, title = {A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks}, booktitle = {Proceedings of the {IEEE} 35th {IEEE} Real-Time Systems Symposium, {RTSS} 2014, Rome, Italy, December 2-5, 2014}, pages = {118--127}, publisher = {{IEEE} Computer Society}, year = {2014}, url = {https://doi.org/10.1109/RTSS.2014.9}, doi = {10.1109/RTSS.2014.9}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/rtss/ChatterjeePKS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/ChatterjeePKS14, author = {Krishnendu Chatterjee and Andreas Pavlogiannis and Alexander K{\"{o}}{\ss}ler and Ulrich Schmid}, title = {A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks}, journal = {CoRR}, volume = {abs/1409.2291}, year = {2014}, url = {http://arxiv.org/abs/1409.2291}, eprinttype = {arXiv}, eprint = {1409.2291}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChatterjeePKS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/ChatterjeeIPG14, author = {Krishnendu Chatterjee and Rasmus Ibsen{-}Jensen and Andreas Pavlogiannis and Prateesh Goyal}, title = {Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth}, journal = {CoRR}, volume = {abs/1410.7724}, year = {2014}, url = {http://arxiv.org/abs/1410.7724}, eprinttype = {arXiv}, eprint = {1410.7724}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ChatterjeeIPG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/bmcbi/PavlogiannisMT13, author = {Andreas Pavlogiannis and Vadim Mozhayskiy and Ilias Tagkopoulos}, title = {A flood-based information flow analysis and network minimization method for gene regulatory networks}, journal = {{BMC} Bioinform.}, volume = {14}, pages = {137}, year = {2013}, url = {https://doi.org/10.1186/1471-2105-14-137}, doi = {10.1186/1471-2105-14-137}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/bmcbi/PavlogiannisMT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/fmcad/ChatterjeeHOP13, author = {Krishnendu Chatterjee and Thomas A. Henzinger and Jan Otop and Andreas Pavlogiannis}, title = {Distributed synthesis for {LTL} fragments}, booktitle = {Formal Methods in Computer-Aided Design, {FMCAD} 2013, Portland, OR, USA, October 20-23, 2013}, pages = {18--25}, publisher = {{IEEE}}, year = {2013}, url = {https://ieeexplore.ieee.org/document/6679386/}, timestamp = {Mon, 09 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fmcad/ChatterjeeHOP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/tcs/ChatzigiannakisMNPS11, author = {Ioannis Chatzigiannakis and Othon Michail and Stavros Nikolaou and Andreas Pavlogiannis and Paul G. Spirakis}, title = {Passively mobile communicating machines that use restricted space}, journal = {Theor. Comput. Sci.}, volume = {412}, number = {46}, pages = {6469--6483}, year = {2011}, url = {https://doi.org/10.1016/j.tcs.2011.07.001}, doi = {10.1016/J.TCS.2011.07.001}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChatzigiannakisMNPS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/dialm/ChatzigiannakisMNPS11, author = {Ioannis Chatzigiannakis and Othon Michail and Stavros Nikolaou and Andreas Pavlogiannis and Paul G. Spirakis}, editor = {Augustin Chaintreau and Dariusz R. Kowalski}, title = {Passively mobile communicating machines that use restricted space}, booktitle = {FOMC'11, The Seventh {ACM} {SIGACT/SIGMOBILE} International Workshop on Foundations of Mobile Computing (part of {FCRC} 2011), San Jose, CA, USA, June 9, 2011, Proceedings}, pages = {6--15}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1998476.1998480}, doi = {10.1145/1998476.1998480}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/dialm/ChatzigiannakisMNPS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @inproceedings{DBLP:conf/mfcs/ChatzigiannakisMNPS10, author = {Ioannis Chatzigiannakis and Othon Michail and Stavros Nikolaou and Andreas Pavlogiannis and Paul G. Spirakis}, editor = {Petr Hlinen{\'{y}} and Anton{\'{\i}}n Kucera}, title = {All Symmetric Predicates in \emph{NSPACE}(\emph{n}\({}^{\mbox{2}}\)) Are Stably Computable by the Mediated Population Protocol Model}, booktitle = {Mathematical Foundations of Computer Science 2010, 35th International Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6281}, pages = {270--281}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-15155-2\_25}, doi = {10.1007/978-3-642-15155-2\_25}, timestamp = {Fri, 30 Aug 2019 10:02:28 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/ChatzigiannakisMNPS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-1004-3395, author = {Ioannis Chatzigiannakis and Othon Michail and Stavros Nikolaou and Andreas Pavlogiannis and Paul G. Spirakis}, title = {Passively Mobile Communicating Logarithmic Space Machines}, journal = {CoRR}, volume = {abs/1004.3395}, year = {2010}, url = {http://arxiv.org/abs/1004.3395}, eprinttype = {arXiv}, eprint = {1004.3395}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1004-3395.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} } @article{DBLP:journals/corr/abs-1012-2440, author = {Ioannis Chatzigiannakis and Othon Michail and Stavros Nikolaou and Andreas Pavlogiannis and Paul G. Spirakis}, title = {Passively Mobile Communicating Machines that Use Restricted Space}, journal = {CoRR}, volume = {abs/1012.2440}, year = {2010}, url = {http://arxiv.org/abs/1012.2440}, eprinttype = {arXiv}, eprint = {1012.2440}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1012-2440.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }