Mikhail A. Raskin

Theor. Comput. Sci., 2023

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy.

[BibT_eX]

[DOI]

A. R. Balasubramanian

Log. Methods Comput. Sci., 2023

Geometry of Reachability Sets of Vector Addition Systems.

[BibT_eX]

[DOI]

Roland Guttenberg

Proceedings of the 34th International Conference on Concurrency Theory, 2023

Giant Components in Random Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2023

2022

Examples for submission to CONCUR'22.

[BibT_eX]

[DOI]

Dataset, April, 2022

Examples for submission to CONCUR'22.

[BibT_eX]

[DOI]

Dataset, April, 2022

Computing Parameterized Invariants of Parameterized Petri Nets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2022

Geometry of VAS reachability sets.

[BibT_eX]

[DOI]

Roland Guttenberg

CoRR, 2022

QueryFS: compiling queries to define a filesystem.

[BibT_eX]

[DOI]

Proceedings of the 15th European Lisp Symposium, 2022

Regular Model Checking Upside-Down: An Invariant-Based Approach.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

The Complexity of Reachability in Affine Vector Addition Systems with States.

[BibT_eX]

[DOI]

Michael Blondin

Log. Methods Comput. Sci., 2021

Affine Extensions of Integer Vector Addition Systems with States.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2021

The complexity of verifying population protocols.

[BibT_eX]

[DOI]

Distributed Comput., 2021

Modular population protocols.

[BibT_eX]

[DOI]

CoRR, 2021

Abduction of trap invariants in parameterized systems.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th International Symposium on Games, 2021

Lisp in the middle - using Lisp to manage a Linux system.

[BibT_eX]

[DOI]

Proceedings of the 14th European Lisp Symposium, 2021

Population Protocols with Unreliable Communication.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2021

2020

heron.

[BibT_eX]

[DOI]

Dataset, October, 2020

heron.

[BibT_eX]

[DOI]

Dataset, October, 2020

heron.

[BibT_eX]

[DOI]

Dataset, October, 2020

heron.

[BibT_eX]

[DOI]

Dataset, October, 2020

heron.

[BibT_eX]

[DOI]

Dataset, July, 2020

ostrich.

[BibT_eX]

[DOI]

Dataset, February, 2020

ostrich.

[BibT_eX]

[DOI]

Dataset, February, 2020

Minimization of visibly pushdown automata is NP-complete.

[BibT_eX]

[DOI]

Olivier Gauwin

Anca Muscholl

Log. Methods Comput. Sci., 2020

A unified algorithm for colouring graphs of bounded clique-width.

[BibT_eX]

[DOI]

Bruno Courcelle

Irène Durand

CoRR, 2020

Constructive expressive power of population protocols.

[BibT_eX]

[DOI]

CoRR, 2020

On the Flatness of Immediate Observation Petri Nets.

[BibT_eX]

[DOI]

CoRR, 2020

Efficient Restrictions of Immediate Observation Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 14th International Conference, 2020

Flatness and Complexity of Immediate Observation Petri Nets.

[BibT_eX]

[DOI]

Kristoffer Arnsfelt Hansen

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

A Stay-in-a-Set Game without a Stationary Equilibrium.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Tenth International Symposium on Games, 2019

Working with First Order Proofs and Provers.

[BibT_eX]

[DOI]

Proceedings of the 12th European Lisp Symposium (ELS 2019), 2019

Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead.

[BibT_eX]

[DOI]

Mark Simkin

Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

Parameterized Analysis of Immediate Observation Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2019

2018

Oblivious RAM with Small Storage Overhead.

[BibT_eX]

[DOI]

Mark Simkin

IACR Cryptol. ePrint Arch., 2018

A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Lower bounds on communication for multiparty computation of multiple AND instances with secret sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Writing a Portable Code Walker in Common Lisp.

[BibT_eX]

[DOI]

Proceedings of the 10th European Lisp Symposium (ELS 2017), 2017

2016

Paradoxical examples of social networks games with product choice.

[BibT_eX]

[DOI]

N. Nikitenkov

CoRR, 2016

Accessing Local Variables During Debugging.

[BibT_eX]

[DOI]

Nikita Mamardashvili

Proceedings of the 9th European Lisp Symposium (ELS 2016), Kraków, Poland, May 9-10, 2016., 2016

On the Communication Required for Unconditionally Secure Multiplication.

[BibT_eX]

[DOI]

Ivan Damgård

Jesper Buus Nielsen

Antigoni Polychroniadou

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2014

Approximating the minimum cycle mean.

[BibT_eX]

[DOI]

Krishnendu Chatterjee

Monika Henzinger

Sebastian Krinninger

Veronika Loitzenbauer

Theor. Comput. Sci., 2014

Remark on "Toom's partial order is transitive" published in <i>Probl. Peredachi Inf.</i>, 2012, no. 2.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2014

2013

Data-Transformer: an Example of Data-Centered Toolset.

[BibT_eX]

[DOI]

Proceedings of ELS 2013 - 6th European Lisp Symposium, Madrid, Spain, June 3-4, 2013., 2013

2012

Toom's partial order is transitive.

[BibT_eX]

[DOI]