default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlga Tveretina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Olga Tveretina:
On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps. RP 2024: 141-153- 2022
- [c18]Mateus de Oliveira Oliveira, Olga Tveretina:
Mortality and Edge-to-Edge Reachability are Decidable on Surfaces. HSCC 2022: 16:1-16:10 - 2021
- [c17]Raimund Kirner
, Simon Maurer, Olga Tveretina:
Component Interfaces with Loosely Synchronous Communication. SA 2021: 1-8 - 2020
- [j5]Olga Tveretina, Pavel Zaichenkov, Alex Shafarenko:
Non-local configuration of component interfaces by constraint satisfaction. Constraints An Int. J. 25(3-4): 121-159 (2020)
2010 – 2019
- 2019
- [c16]Andrei Sandler, Olga Tveretina:
Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds. RP 2019: 178-192 - 2017
- [c15]Andrei Sandler, Olga Tveretina:
ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems. GandALF 2017: 283-296 - [i5]Olga Tveretina:
Resolution Simulates Polynomially Ordered Binary Decision Diagrams for Conjunctive Normal Forms. CoRR abs/1701.02275 (2017) - 2016
- [j4]Pavel Zaichenkov, Olga Tveretina, Alex Shafarenko, Bert Gijsbers, Clemens Grelck:
The Cost and Benefits of Coordination Programming: Two Case Studies in Concurrent Collections and S-NET. Parallel Process. Lett. 26(3): 1650011:1-1650011:24 (2016) - [c14]Pavel Zaichenkov, Olga Tveretina, Alex Shafarenko:
A Constraint Satisfaction Method for Configuring Non-local Service Interfaces. IFM 2016: 474-488 - [c13]Pavel Zaichenkov, Olga Tveretina, Alex Shafarenko:
Configuring Cloud-Service Interfaces Using Flow Inheritance. iFMCloud@IFM 2016: 27-34 - [i4]Pavel Zaichenkov, Olga Tveretina, Alex Shafarenko:
A Constraint Satisfaction Method for Configuring Non-Local Service Interfaces. CoRR abs/1601.03370 (2016) - 2015
- [i3]Pavel Zaichenkov, Olga Tveretina, Alex Shafarenko:
Constraint Satisfaction in Coordinating Components Interfaces. CoRR abs/1503.00622 (2015) - 2014
- [c12]Pavel Zaichenkov, Bert Gijsbers, Clemens Grelck, Olga Tveretina, Alex Shafarenko:
A Case Study in Coordination Programming: Performance Evaluation of S-Net vs Intel's Concurrent Collections. IPDPS Workshops 2014: 1059-1067 - 2013
- [c11]Olga Tveretina:
A Conditional Superpolynomial Lower Bound for Extended Resolution. LATA 2013: 559-569 - [i2]Pavels Zaicenkovs, Bert Gijsbers, Clemens Grelck, Olga Tveretina, Alexander V. Shafarenko:
Communication-Centric Solution for Cholesky Decomposition: Industrial Case Study for Coordination Programming. CoRR abs/1305.7167 (2013) - 2011
- [c10]Tamara Mendt, Carsten Sinz, Olga Tveretina:
Probabilistic Model Checking of Constraints in a Supply Chain Business Process. BIS 2011: 1-12 - [c9]Tamara Mendt, Carsten Sinz, Olga Tveretina:
Analyzing Separation of Duties Constraints with a Probabilistic Model Checker. BIS (Workshops) 2011: 18-29 - [c8]Olga Tveretina, Daniel Funke:
Deciding Reachability for 3-Dimensional Multi-Linear Systems. GandALF 2011: 250-262 - 2010
- [j3]Olga Tveretina, Carsten Sinz, Hans Zantema:
Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond. J. Satisf. Boolean Model. Comput. 7(1): 35-58 (2010)
2000 – 2009
- 2009
- [c7]Olga Tveretina, Carsten Sinz, Hans Zantema:
An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas. ACAC 2009: 13-21 - [i1]Olga Tveretina, Carsten Sinz, Hans Zantema:
Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c6]Milad Niqui, Olga Tveretina:
Modular Development of Hybrid Systems for Verification in Coq. HSCC 2008: 638-641 - 2007
- [j2]Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema:
Generalizing DPLL and satisfiability for equalities. Inf. Comput. 205(8): 1188-1211 (2007) - 2006
- [c5]Olga Tveretina, Wieger Wesselink:
EufDpll - A Tool to Check Satisfiability of Equality Logic Formulas. MFCSIT 2006: 405-420 - 2005
- [c4]Jaco van de Pol, Olga Tveretina:
A BDD-Representation for the Logic of Equality and Uninterpreted Functions. MFCS 2005: 769-780 - 2004
- [c3]Olga Tveretina:
A Decision Procedure for Equality Logic with Uninterpreted Functions. AISC 2004: 66-79 - [c2]Olga Tveretina, Hans Zantema:
A Proof System and a Decision Procedure for Equality Logic. LATIN 2004: 530-539 - 2003
- [j1]Jan Friso Groote, Olga Tveretina:
Binary decision diagrams for first-order predicate logic. J. Log. Algebraic Methods Program. 57(1-2): 1-22 (2003)
1990 – 1999
- 1998
- [c1]Lilia Kashirova, Olga Tveretina:
Entropy-Based Design of Low Power FSMs. EUROMICRO 1998: 10188-10191
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional 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 information given by OpenAlex.
last updated on 2024-09-30 21:00 CEST 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:
