


default search action
Information and Computation, Volume 252
Volume 252, February 2017
- Paolo Baldan, Daniele Gorla
:
Preface. 1 - Filippo Bonchi
, Pawel Sobocinski
, Fabio Zanasi
:
The Calculus of Signal Flow Diagrams I: Linear relations on streams. 2-29 - Alexander Kaiser, Daniel Kroening
, Thomas Wahl:
Lost in abstraction: Monotonicity in multi-threaded programs. 30-47 - Naoki Kobayashi
, Cosimo Laneve
:
Deadlock analysis of unbounded process networks. 48-70 - Barbara König, Jan Stückrath:
Well-structured graph transformation systems. 71-94 - Igor V. Konnov
, Helmut Veith, Josef Widder
:
On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability. 95-109 - Natsuki Urabe, Ichiro Hasuo
:
Quantitative simulations by matrices. 110-137
- Bingkai Lin
, Yijia Chen:
The parameterized complexity of k-edge induced subgraphs. 138-160 - Andreas D. M. Gunawan, Bhaskar DasGupta, Louxin Zhang:
A decomposition theorem and two algorithms for reticulation-visible networks. 161-175 - Tim Smith
:
A new pumping lemma for indexed languages, with an application to infinite words. 176-186 - Wenjun Li, Yixin Cao
, Jianer Chen, Jianxin Wang:
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree. 187-200 - Gianluigi Greco, Francesco Scarcello
:
Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems. 201-220 - Arnaud Carayol, Olivier Serre:
Counting branches in trees using games. 221-242 - Euripides Markou, Nicolas Nisse, Stéphane Pérennes:
Exclusive graph searching vs. pathwidth. 243-260

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.