| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Razvan Diaconescu |
Coinduction for preordered algebra.  |
Inf. Comput.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matteo Pradella, Alessandra Cherubini, Stefano Crespi-Reghizzi |
A unifying approach to picture grammars. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt |
On the expressiveness and decidability of higher-order process calculi. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pedro Sánchez Terraf |
Unprovability of the logical characterization of bisimulation. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Josée Desharnais, François Laviolette, Amélie Turgeon |
A logical duality for underspecified probabilistic systems. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos Martín-Vide, Bianca Truthe |
3rd International Conference on Language and Automata Theory and Applications (LATA 2009). |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen |
On the complexity of some colorful problems parameterized by treewidth. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang |
Extracting Kolmogorov complexity with applications to dimension zero-one laws. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Johannes Köbler, Sebastian Müller |
Proof systems that take advice. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Lohrey |
Leaf languages and string compression. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ou Wei, Arie Gurfinkel, Marsha Chechik |
On the consistency, expressiveness, and precision of partial modeling formalisms. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Aduri Pavan, Stephen D. Travers |
The fault tolerance of NP-hard problems. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota |
Partially-commutative context-free processes: Expressibility and tractability. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul C. Attie, Rachid Guerraoui, Petr Kuznetsov, Nancy A. Lynch, Sergio Rajsbaum |
The impossibility of boosting distributed service resilience. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Martin Kutrib |
Descriptional and computational complexity of finite automata - A survey. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Baillot, Paolo Coppola, Ugo Dal Lago |
Light logics and optimal reduction: Completeness and complexity. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Armin Hemmerling |
Observations on complete sets between linear time and polynomial time. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sungwoo Park, Hyeonseung Im |
A modal logic internalizing normal proofs. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Skoric, Chibuzo Obi, Evgeny A. Verbitskiy, Berry Schoenmakers |
Sharp lower bounds on the extractable randomness from non-uniform sources. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher Lynch, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran |
Automatic decidability and combinability. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Gauwin, Joachim Niehren, Sophie Tison |
Queries on Xml streams with bounded delay and concurrency. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphaël Bailly, François Denis |
Absolute convergence of rational series is semi-decidable. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Janusz A. Brzozowski, Jeffrey Shallit, Zhi Xu |
Decision problems for convex languages. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Claudio Hermida |
A categorical outlook on relational modalities and simulations. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Valeria de Paiva, Brigitte Pientka |
Intuitionistic Modal Logic and Applications (IMLA 2008). |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Giovanni Pighizzini |
Two-way unary automata versus logarithmic space. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cédric Dégremont, Nina Gierasimczuk |
Finite identification from the viewpoint of epistemic update. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Gray, António Malheiro, Stephen J. Pride |
On properties not inherited by monoids from their Schützenberger groups. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryszard Janicki, Dai Tri Man Le |
Modelling concurrency with comtraces and generalized comtraces. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang |
Faster query algorithms for the text fingerprinting problem. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjay Jain |
Hypothesis spaces for learning. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kensuke Kojima, Atsushi Igarashi |
Constructive linear-time temporal logic: Proof systems and Kripke semantics. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Lameiras Campagnolo, Kerry Ojakian |
A characterization of computable analysis on unbounded domains using differential equations. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten |
Quantitative Kleene coalgebras. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Abuzer Yakaryilmaz, A. C. Cem Say |
Unbounded-error quantum computation with small space bounds. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank J. Balbach, Thomas Zeugmann |
Teaching randomized learners with feedback. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
Larger lower bounds on the OBDD complexity of integer multiplication. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kaoru Fujioka |
Morphic characterizations of languages in Chomsky hierarchy with insertion and locality. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Hermanns, Augusto Parma, Roberto Segala, Björn Wachter, Lijun Zhang |
Probabilistic Logical Characterization. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani |
Characterizing contextual equivalence in calculi with passivation. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gad M. Landau, Avivit Levy, Ilan Newman |
LCS approximation via embedding into locally non-repetitive strings. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Arie M. C. A. Koster |
Treewidth computations II. Lower bounds. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Dov M. Gabbay |
Reactive automata. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Celine Scornavacca, Vincent Berry, Vincent Ranwez |
Building species trees from larger parts of phylogenomic databases. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Razvan Diaconescu |
Structural induction in institutions. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek |
Qualitative reachability in stochastic BPA games. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Galmiche, Yakoub Salhi |
Sequent calculi and decidability for intuitionistic hybrid logic. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai Salomaa |
Limitations of lower bound methods for deterministic nested word automata. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Czeizler, Eugen Czeizler, Lila Kari, Shinnosuke Seki |
An extension of the Lyndon-Schützenberger result to pseudoperiodic words. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Ryabko, Daniil Ryabko |
Constructing perfect steganographic systems. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Masami Ito, Peter Leupold, Florin Manea, Victor Mitrana |
Bounded hairpin completion. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Julian Gutierrez, Julian C. Bradfield |
Model-checking games for fixpoint logics with partial order models. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hayato Takahashi |
Algorithmic randomness and monotone complexity on product space. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilles Dowek, Ying Jiang |
On the expressive power of schemes. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Hague, C.-H. Luke Ong |
A saturation method for the modal μ-calculus over pushdown systems. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Markus Holzer, Martin Kutrib |
Decidability of operation problems for T0L languages and subclasses. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Galina Jirásková, Giovanni Pighizzini |
Optimal simulation of self-verifying automata by deterministic automata. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Juha Kontinen, Hannu Niemistö |
Extensions of MSO and the monadic counting hierarchy. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgi Japaridze |
Introduction to clarithmetic I. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Moore |
Computational complexity of the problem of tree generation under fine-grained access control policies. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena V. Pribavkina, Emanuele Rodaro |
Synchronizing automata with finitely many minimal synchronizing words. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc |
Optimality and competitiveness of exploring polygons by mobile robots. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeroen Ketema, Jakob Grue Simonsen |
Infinitary Combinatory Reduction Systems. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ting Yi Chang |
An ID-based multi-signer universal designated multi-verifier signature scheme. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Mendler, Stephan Scheele |
Cut-free Gentzen calculus for multimodal CK. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin |
A classification of the expressive power of well-structured transition systems. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Gacek, Dale Miller, Gopalan Nadathur |
Nominal abstraction. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jürgen Dassow, Victor Mitrana, Bianca Truthe |
The role of evolutionary operations in accepting hybrid networks of evolutionary processors. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sicco Verwer, Mathijs de Weerdt, Cees Witteveen |
The efficiency of identifying timed automata and the power of clocks. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent Jacquemard, Francis Klay, Camille Vacher |
Rigid tree automata and applications. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Elitza N. Maneva |
Mean-payoff games and propositional proofs. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Torben Braüner |
Intuitionistic hybrid logic: Introduction and survey. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | John Case, Samuel E. Moelius |
Optimal language learning from positive data. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Arroyuelo, Gonzalo Navarro |
Space-efficient construction of Lempel-Ziv compressed text indexes. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bas Ploeger, Wieger Wesselink, Tim A. C. Willemse |
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryuichi Matoba, Makoto Nakamura, Satoshi Tojo |
Efficiency of the symmetry bias in grammar acquisition. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Endrullis, Herman Geuvers, Jakob Grue Simonsen, Hans Zantema |
Levels of undecidability in rewriting. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iddo Tzameret |
Algebraic proofs over noncommutative formulas. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandra Carbone |
A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger |
Strategy construction for parity games with imperfect information. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Brasoveanu |
Structured anaphora to quantifier domains. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonín Kucera, Richard Mayr |
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Juhani Karhumäki, Michal Kunc, Alexander Okhotin |
Computational power of two stacks with restricted communication. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Siders |
On quantifier-rank equivalence between linear orders. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís Caires, Vasco Thudichum Vasconcelos |
18th International Conference on Concurrency Theory. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kim Solin |
A sketch of a dynamic epistemic semiring. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman |
Strategy logic. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martín Abadi, Tim Harris, Katherine F. Moore |
A model of dynamic separation for transactional memory. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandra Silva, Jan J. M. M. Rutten |
A coinductive calculus of binary trees. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden |
Weak bisimulation is sound and complete for pCTL*. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lucia Acciai, Michele Boreale |
Spatial and behavioral types in the pi-calculus. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesco Ranzato, Francesco Tapparo |
An efficient simulation algorithm based on abstract interpretation. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Bartók, Csaba Szepesvári, Sandra Zilles |
Models of active learning in group-structured state spaces. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Matsliah, Ofer Strichman |
Underapproximation for model-checking based on universal circuits. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Arie M. C. A. Koster |
Treewidth computations I. Upper bounds. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Schwencke |
Coequational logic for accessible functors. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaella Bernardi, Michael Moortgat |
Continuation semantics for the Lambek-Grishin calculus. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Mendler, Gerald Lüttgen |
Is observational congruence on µ-expressions axiomatisable in equational Horn logic? |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan A. Bergstra, C. A. Middelburg |
A thread calculus with molecular dynamics. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")