Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDMarijana Lazic
Person information
- affiliation: TU Munich, Department of Informatics, Germany
- affiliation: TU Vienna, LogiCS, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c9]Nathalie Bertrand
, Marijana Lazic, Josef Widder:
A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries. VMCAI 2021: 219-239- 2020
- [c8]A. R. Balasubramanian, Javier Esparza, Marijana Lazic:
Complexity of Verification and Synthesis of Threshold Automata. ATVA 2020: 144-160 - [c7]Igor Konnov, Marijana Lazic, Ilina Stoilkovska, Josef Widder:
Tutorial: Parameterized Verification with Byzantine Model Checker. FORTE 2020: 189-207 - [i5]A. R. Balasubramanian, Javier Esparza, Marijana Lazic:
Complexity of Verification and Synthesis of Threshold Automata. CoRR abs/2007.06248 (2020) - [i4]Igor Konnov, Marijana Lazic, Ilina Stoilkovska, Josef Widder:
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker. CoRR abs/2011.14789 (2020)
2010 – 2019
- 2019
- [c6]Idan Berkovits, Marijana Lazic, Giuliano Losa, Oded Padon, Sharon Shoham:
Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics. CAV (2) 2019: 245-266 - [c5]Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder:
Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries. CONCUR 2019: 33:1-33:15 - [c4]Éric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum:
A Dynamic Epistemic Logic Analysis of the Equality Negation Task. DaLí 2019: 53-70 - [c3]Éric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum:
Wait-Free Solvability of Equality Negation Tasks. DISC 2019: 21:1-21:16 - [i3]Idan Berkovits, Marijana Lazic, Giuliano Losa, Oded Padon, Sharon Shoham:
Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics. CoRR abs/1905.07805 (2019) - [i2]Eric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum:
A dynamic epistemic logic analysis of the equality negation task. CoRR abs/1909.03263 (2019) - 2017
- [j1]Igor Konnov, Marijana Lazic, Helmut Veith, Josef Widder:
Para2: parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms. Formal Methods Syst. Des. 51(2): 270-307 (2017) - [c2]Marijana Lazic, Igor Konnov, Josef Widder, Roderick Bloem:
Synthesis of Distributed Algorithms with Parameterized Threshold Guards. OPODIS 2017: 32:1-32:20 - [c1]Igor V. Konnov, Marijana Lazic, Helmut Veith, Josef Widder:
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms. POPL 2017: 719-734 - 2016
- [i1]Igor Konnov, Marijana Lazic, Helmut Veith, Josef Widder:
A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms. CoRR abs/1608.05327 (2016)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-01-26 23:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
