default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDActa Informatica, Volume 49
Volume 49, Number 1, February 2012
- Edward G. Coffman Jr., Dariusz Dereniowski
, Wieslaw Kubiak:
An efficient algorithm for finding ideal schedules. 1-14 - Yunhe Wang, Li Jiao:
Using transition set sequences to partition behaviors of petri nets. 15-28 - Symeon Bozapalidis, Zoltán Fülöp, George Rahonis:
Equational weighted tree transformations. 29-52 - Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein:
Erratum to: Avoidable binary patterns in partial words. 53-54
Volume 49, Number 2, March 2012
- Alexander Meduna, Petr Zemek:
Nonterminal complexity of one-sided random context grammars. 55-68 - Christian Stahl, Walter Vogler:
A trace-based service semantics guaranteeing deadlock freedom. 69-103 - Aivars Lorencs:
The identity problem of finitely generated bi-ideals. 105-115
Volume 49, Number 3, May 2012
- Pierre Lescanne, Matthieu Perrinel:
"Backward" coinduction, Nash equilibrium and the rationality of escalation. 117-137 - Jan A. Bergstra, Cornelis A. Middelburg:
Instruction sequence processing operators. 139-172 - Junhu Wang, Jeffrey Xu Yu, Chaoyi Pang, Chengfei Liu:
Least common container of tree pattern queries and its applications. 173-202
Volume 49, Number 4, June 2012
- Christel Baier, Tomás Brázdil, Marcus Größer, Antonín Kucera:
Stochastic game logic. 203-224 - Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
First-order logics: some characterizations and closure properties. 225-248 - Laura Bozzelli, Axel Legay, Sophie Pinchinat:
On timed alternating simulation for concurrent timed games. 249-279
Volume 49, Number 5, August 2012
- Chen-Ming Fan, Cheng-Chih Huang, Christine Chifen Tseng, Jen-Tse Wang:
Prefix-primitive annihilators of languages under some operations. 281-293 - Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger:
An algorithmic study of switch graphs. 295-312 - Antonella Santone, Gigliola Vaglini:
Abstract reduction in directed model checking CCS processes. 313-341 - Walter Guttmann:
Algebras for iteration and infinite computations. 343-359
Volume 49, Number 6, September 2012
- Zhiyi Tan, Long Wan, Qi Zhang, Wei Ren:
Inefficiency of equilibria for the machine covering game on uniform machines. 361-379 - Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma:
Finding vertex-surjective graph homomorphisms. 381-394 - Cristian Ioan Vasile, Ana Brândusa Pavel, Ioan Dumitrache, Gheorghe Paun:
On the power of enzymatic numerical P systems. 395-412 - Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot:
Multi-tilde-bar expressions and their automata. 413-436
Volume 49, Numbers 7-8, November 2012
- Chunhua Cao, Di Yang, Yin Liu:
Disjunctive languages related to p-primitive words. 437-444 - Xian Xu:
Distinguishing and relating higher-order and first-order processes by expressiveness. 445-484 - Michael Brand:
Does indirect addressing matter? - A note. 485-491
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.
last updated on 2025-02-09 14:46 CET 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:
