activity
20092017
most citedAn Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas

7 citations · 7 across the 4 of their papers we have counts for

collaborators

5 papers

cs.DC2017

ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems

Andrei Sandler, Olga Tveretina

We present the ParaPlan tool which provides the reachability analysis of planar hybrid systems defined by differential inclusions (SPDI). It uses the parallelized and optimized ver…

cs.LO2016

A Constraint Satisfaction Method for Configuring Non-Local Service Interfaces

Pavel Zaichenkov, Olga Tveretina, Alex Shafarenko

Modularity and decontextualisation are core principles of a service-oriented architecture. However, the principles are often lost when it comes to an implementation of services, as…

cs.PL2015

Interface Reconciliation in Kahn Process Networks using CSP and SAT

Pavel Zaichenkov, Olga Tveretina, Alex Shafarenko

We present a new CSP- and SAT-based approach for coordinating interfaces of distributed stream-connected components provided as closed-source services. The Kahn Process Network (KP…

cs.LO2011

Deciding Reachability for 3-Dimensional Multi-Linear Systems

Olga Tveretina, Daniel Funke

This paper deals with the problem of point-to-point reachability in multi-linear systems. These systems consist of a partition of the Euclidean space into a finite number of region…

cs.CC20097 cited

An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas

Olga Tveretina, Carsten Sinz, Hans Zantema

Haken proved that every resolution refutation of the pigeonhole formula has at least exponential size. Groote and Zantema proved that a particular OBDD computation of the pigeonhol…