| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Pavol Cerný, Thomas A. Henzinger, Arjun Radhakrishna |
Simulation distances.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Norihiro Kamide, Heinrich Wansing |
Proof theory of Nelson's paraconsistent logic: A uniform perspective. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Nicolas Thibault |
Randomized truthful algorithms for scheduling selfish tasks on parallel machines. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Schmied, Claus Viehmann |
Approximating edge dominating set in dense graphs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga, Mark Timmer |
A linear process-algebraic format with data for probabilistic automata. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandra Di Pierro, Gethin Norman |
Editorial: Quantitative Aspects of Programming Languages. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | François Petitjean, Pierre Gançarski |
Summarizing a set of time series by averaging: From Steiner sequence to compact multiple alignment. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yisong Wang, Jia-Huai You, Li-Yan Yuan, Yi-Dong Shen, Mingyi Zhang |
The loop formula based semantics of description logic programs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Angsheng Li, Yicheng Pan |
Characterizations of locally testable linear- and affine-invariant families. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
Updating the complexity status of coloring graphs without a fixed induced linear forest. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marion Le Gonidec |
On the complexity of a family of k-context-free sequences. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard A. Hayden, Anton Stefanek, Jeremy T. Bradley |
Fluid computation of passage-time distributions in large Markov models. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano |
Quantitatively fair scheduling. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Katarzyna Jesse-Józefczyk |
The possible cardinalities of global secure sets in cographs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Aldini |
Approximating Markovian testing equivalence. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Petria |
Generic constructions for behavioral specifications. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Elvira Albert, Puri Arenas, Samir Genaim, German Puebla, Damiano Zanardini |
Cost analysis of object-oriented bytecode programs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Dekking |
Paperfolding morphisms, planefilling curves, and fractal tiles. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Faranak Heidarian, Julien Schmaltz, Frits W. Vaandrager |
Analysis of a clock synchronization protocol for wireless sensor networks. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Suzana Andova, Sonja Georgievska, Nikola Trcka |
Branching bisimulation congruence for probabilistic systems. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Philippou, Insup Lee, Oleg Sokolsky |
PADS: An approach to modeling resource demand and supply for the formal analysis of hierarchical scheduling. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Angsheng Li |
Theory and applications of models of computation (TAMC 2008). |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng |
Competitive routing over time. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Enrico Angelelli, Carlo Filippi |
On the complexity of interval scheduling with a resource constraint. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Baptiste Rouquier, Damien Regnault, Eric Thierry |
Stochastic minority on graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar |
Verification of mobile ad hoc networks: An algebraic approach. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Delia Kesner, Fabien Renaud |
A prismoid framework for languages with resources. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wonhong Nam, Hyunyoung Kil, Dongwon Lee |
On the computational complexity of behavioral description-based web service composition. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Steinberg |
The Černý conjecture for one-cluster automata with prime length cycle. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl |
Parameterized complexity of coloring problems: Treewidth versus vertex cover. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anders Kock |
Affine connections, midpoint formation, and point reflection. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Walter Didimo, Peter Eades, Giuseppe Liotta |
Drawing graphs with right angle crossings. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aurélien Rizk, Grégory Batt, François Fages, Sylvain Soliman |
Continuous valuations of temporal logic specifications with applications to parameter optimization and robustness measures. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Bubeck, Rémi Munos, Gilles Stoltz |
Pure exploration in finitely-armed and continuous-armed bandits. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Marschall |
Construction of minimal deterministic finite automata from biological motifs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Giovanni Pardini |
Spatial Calculus of Looping Sequences. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Sutner |
Computational processes, observers and Turing incompleteness. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | John G. Stell, Michael F. Worboys |
Relations between adjacency trees. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Artiom Alhazov, Sergey Verlan |
Minimization strategies for maximally parallel multiset rewriting systems. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sherzod Turaev, Jürgen Dassow, Mohd Hasan Selamat |
Nonterminal complexity of tree controlled grammars. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuai Cheng Li, Yen Kaow Ng |
On protein structure alignment under distance constraint. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
Yet harder knapsack problems. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, C. S. Vlek |
Kolmogorov complexity of initial segments of sequences and arithmetical definability. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski, Paul Medvedev, Martin Milanic |
Shortest paths between shortest paths. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cong Tian, Zhenhua Duan |
Expressiveness of propositional projection temporal logic with star. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryo Yoshinaka |
Efficient learning of multiple context-free languages with multidimensional substitutability from positive data. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesca Cordero, András Horváth, Daniele Manini, Lucia Napione, Massimiliano De Pierro, Simona Pavan, Andrea Picco, Andrea Veglio, Matteo Sereno, Federico Bussolino, Gianfranco Balbo |
Simplification of a complex signal transduction model using invariants and flow equivalent servers. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon |
Palindromic complexity of codings of rotations. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | César Domínguez, Julio Rubio |
Effective homology of bicomplexes, formalized in Coq. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan A. Bergstra, Jaco van de Pol |
A calculus for four-valued sequential logic. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin S. Szczuka, Dominik Slezak |
Feedforward neural networks for compound signals. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum, Ana Sokolova |
Information hiding in probabilistic concurrent systems. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuan-Kang Shih, Shin-Shin Kao |
One-to-one disjoint path covers on k-ary n-cubes. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Paul Allouche, Laurence Maillard-Teyssier |
Inconstancy of finite and infinite sequences. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftah Gamzu |
Improved lower bounds for non-utilitarian truthfulness. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoyang Gu, Jack H. Lutz |
Effective dimensions and relative frequencies. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Robinson, Ulrich Schmid |
The Asynchronous Bounded-Cycle model. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elberfeld, Johannes Textor |
Negative selection algorithms on strings with efficient training and linear-time classification. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Gutin, Mark Jones, Anders Yeo |
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Jun Tarui |
A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil A. McKay |
Canonical forms of uptimals. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Murat Cenk, Ferruh Özbudak |
Multiplication of polynomials modulo xn. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Woryna |
The concept of duality for automata over a changing alphabet and generation of a free group by such automata. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dirk van Dalen |
Brouwer's ϵ-fixed point and Sperner's lemma. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle |
The directed Hausdorff distance between imprecise point sets. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Carme Àlvarez, Maria J. Blesa, Maria J. Serna |
The robustness of stability under link and node failures. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristian S. Calude, Kai Salomaa, Tania Roblot |
Finite state complexity. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shenghui Su, Shuwang Lü, Xiubin Fan |
Asymptotic granularity reduction and its application. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vashti Galpin, Jane Hillston |
A semantic equivalence for Bio-PEPA based on discretisation of continuous values. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Goles Ch., A. Moreira, Ivan Rapaport |
Communication complexity in number-conserving and monotone cellular automata. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala |
Untangled monotonic chains and adaptive range search. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop, Vincent van Oostrom |
On equal μ-terms. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jorge Arturo Cobb, Mohamed G. Gouda |
Stabilization of max-min fair networks without per-flow state. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Li Chen, Bin Fu |
Linear and sublinear time algorithms for the basis of abelian groups. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie |
The distributed wireless gathering problem. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nedialko B. Dimitrov, C. Greg Plaxton |
Buyer-supplier games: Optimization over the core. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryotaro Okazaki, Hirotaka Ono, Taizo Sadahiro, Masafumi Yamashita |
Broadcastings and digit tilings on three-dimensional torus networks. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Perrucci |
Linear solving for sign determination. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruo-Wei Hung |
Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Adriana Balan, Alexander Kurz |
On coalgebras over algebras. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eddie Cheng, Marc J. Lipman, László Lipták, David Sherman |
Conditional matching preclusion for the arrangement graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianxin Wang, Qilong Feng, Jianer Chen |
An O*(3.533k)-time parameterized algorithm for the 3-set packing problem. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aurélien Naldi, Elisabeth Remy, Denis Thieffry, Claudine Chaouiya |
Dynamically consistent reduction of logical regulatory graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yohji Akama |
Set systems: Order types, continuous nondeterministic deformations, and quasi-orders. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Geoffrey Koh, David Hsu, P. S. Thiagarajan |
Component-based construction of bio-pathway models: The parameter estimation problem. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jarkko Kari |
Preface. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Thao Dang, Colas Le Guernic, Oded Maler |
Computing reachable states for nonlinear biological models. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Steffen Kopecki |
On iterated hairpin completion. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Biely, Ulrich Schmid, Bettina Weiss |
Synchronous consensus under hybrid process and link failures. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Xubin Yue, Xuding Zhu |
The surviving rate of an outerplanar graph for the firefighter problem. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Natasha Alechina, Mehdi Dastani, Brian Logan, John-Jules Ch. Meyer |
Reasoning about plan revision in BDI agent programs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos |
Special Issue on "Theory and Applications of Graph Searching Problems". |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Razvan Diaconescu, Ionut Tutu |
On the algebra of structured specifications. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé |
Equations on palindromes and circular words. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ro-Yu Wu, Jou-Ming Chang, Kung-Jui Pai, Yue-Li Wang |
Amortized efficiency of generating planar paths in convex position. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Turau, Bernd Hauck |
A fault-containing self-stabilizing (3 - 2/(Delta+1))-approximation algorithm for vertex cover in anonymous networks. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier |
Bulking I: An abstract theory of bulking. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | José Espírito Santo |
A note on preservation of strong normalisation in the λ-calculus. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yun Bao Huang |
The complexity of smooth words on 2-letter alphabets. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan |
Universal recursively enumerable sets of strings. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")