| 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 | Julien David |
Average complexity of Moore's and Hopcroft's algorithms. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhifang Zhang, Yeow Meng Chee, San Ling, Mulan Liu, Huaxiong Wang |
Threshold changeable secret sharing schemes revisited. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinnosuke Seki |
Absoluteness of subword inequality is undecidable. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Karl Bringmann, Tobias Friedrich |
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrike Golas, Leen Lambers, Hartmut Ehrig, Fernando Orejas |
Attributed graph transformation with inheritance: Efficient conflict detection and local confluence analysis using abstract critical pairs. |
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 | Leonardo Vanneschi, Yuri Pirola, Giancarlo Mauri, Marco Tomassini, Philippe Collard, Sébastien Vérel |
A study of the neutrality of Boolean function landscapes in genetic programming. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nick Bezhanishvili, Ian M. Hodkinson |
Sahlqvist theorem for modal fixed point logic. |
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 | T. K. Subrahmonian Moothathu |
Eulerian entropy and non-repetitive subword complexity. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Allan Borodin, Ioana Ivan, Yuli Ye, Bryce Zimny |
On sum coloring and sum multi-coloring for restricted families of graphs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Edda Happ, Christian Klein |
Crossover can provably be useful in evolutionary computation. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Teturo Kamae |
Behavior of various complexity functions. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Hanna Mazzawi |
Toward a deterministic polynomial time algorithm with optimal additive query complexity. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko |
Quasi-distinct parsing and optimal compression methods. |
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 | Séverine Fratani |
Regular sets over extended tree structures. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Oksana Yakimova |
Language equations with complementation: Expressive power. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Steffen Finck, Hans-Georg Beyer |
Performance analysis of the simultaneous perturbation stochastic approximation algorithm on the noisy sphere model. |
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 | Tamir Tassa |
Finding all maximally-matchable edges in a bipartite graph. |
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 | Telikepalli Kavitha |
Properties of Gomory-Hu co-cycle bases. |
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 | Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee |
A note on sorting buffers offline. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe |
Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh |
Improved simulation of nondeterministic Turing machines. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ali Çivril, Malik Magdon-Ismail |
Column subset selection via sparse approximation of SVD. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Weiwei Wu, Minming Li, Wanyong Tian, Chun Jason Xue, Enhong Chen |
Single and multiple device DSA problems, complexities and online algorithms. |
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 | Khaled M. Elbassioni, Hans Raj Tiwary |
Complexity of approximating the vertex centroid of a polyhedron. |
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 | Hongli Xu, Liusheng Huang, Wang Liu, Yindong Zhang, Yanjing Sun |
Degree-bounded minimum spanning tree for unit disk graph. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Avraham Ben-Aroya, Amnon Ta-Shma |
Better short-seed quantum-proof extractors. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bhadrachalam Chitturi, Ivan Hal Sudborough |
Bounding prefix transposition distance for strings and permutations. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Renewal theory in the analysis of tries and strings. |
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 | Yourim Yoon, Yong-Hyuk Kim, Alberto Moraglio, Byung Ro Moon |
Quotient geometric crossovers and redundant encodings. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Ésik, Szabolcs Iván |
On Müller context-free grammars. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Grzegorz Rozenberg |
Preface. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
Counting classes and the fine structure between NC1 and L. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulio Caravagna, Jane Hillston |
Bio-PEPAd: A non-Markovian extension of Bio-PEPA. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Gilad Tsur |
Testing computability by width-two OBDDs. |
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 | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Induced packing of odd cycles in planar graphs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Lvzhou Li, Daowen Qiu, Xiangfu Zou, Lvjun Li, Lihua Wu, Paulo Mateus |
Characterizations of one-way general quantum finite automata. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Roman Kolpakov |
On primary and secondary repetitions in words. |
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 | Daniel Kirsten |
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves |
Deterministic recurrent communication in restricted Sensor Networks. |
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 | Shiying Wang, Yuxing Yang |
Fault tolerance in bubble-sort graph networks. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ching-Lueh Chang |
Some results on approximate 1-median selection in metric spaces. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Aldini |
Approximating Markovian testing equivalence. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
Approximating fault-tolerant group-Steiner problems. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick O. Stalph, Xavier Llorà, David E. Goldberg, Martin V. Butz |
Resource management and scalability of the XCSF learning classifier system. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Witt |
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Siamak Tazari |
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin, Christophe Picouleau |
On the NP-completeness of the perfect matching free subgraph problem. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Barbuti, Francesca Levi, Paolo Milazzo, Guido Scatena |
Probabilistic model checking of biological systems with uncertain kinetic rates. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart Zitzler |
Hypervolume-based multiobjective optimization: Theoretical foundations and practical implications. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan Guo |
Winning strategies for aperiodic subtraction games. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Carmel Kent, Moshe Lewenstein, Dafna Sheinwald |
On demand string sorting over unbounded alphabets. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Heiko Vogler |
Weighted automata and multi-valued logics over arbitrary bounded lattices. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Harald Hempel, Michael Krüger |
Inverse Hamiltonian Cycle and inverse 3Dimensional Matching are coNP-complete. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitja Lustrek, Ivan Bratko, Matjaz Gams |
Independent-valued minimax: Pathological or beneficial? |
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 | Marcus Poggi, David Sotelo |
A linear time approximation algorithm for permutation flow shop scheduling. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Antonín Kucera |
Preface. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Kristian Lehre, Frank Neumann, Jonathan E. Rowe, Xin Yao |
Editorial to the special issue on "Theoretical Foundations of Evolutionary Computation". |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Cheng-Nan Lai |
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes. |
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 | William Chung-Kung Yen |
The connected p-center problem on block graphs with forbidden vertices. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Grunsky, Igor Potapov, Elena Pryanichnikova |
On algebra of languages representable by vertex-labeled graphs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Ehrhard |
The Scott model of linear logic is the extensional collapse of its relational model. |
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 | Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio |
Quasi-polynomials, linear Diophantine equations and semi-linear sets. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Grzegorz Rozenberg |
Preface. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Luciano Gualà, Guido Proietti |
Improved approximability and non-approximability results for graph diameter decreasing problems. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Urban Larsson |
The *-operator and invariant subtraction games. |
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 | Luís M. S. Russo |
Monge properties of sequence alignment. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Shenghui Su, Shuwang Lü |
A public key cryptosystem based on three new provable problems. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rob van Stee |
An improved algorithm for online rectangle filling. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiangxu Kong, Weifan Wang, Xuding Zhu |
The surviving rate of planar graphs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuele Giraudo |
Intervals of balanced binary trees in the Tamari lattice. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir M. Ben-Amram, Simon Yoffe |
Corrigendum to "A simple and efficient Union-Find-Delete algorithm" [Theoret. Comput. Sci. 412(4-5) 487-492]. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter |
Arboricity, h-index, and dynamic algorithms. |
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 | Bin Fu, Yumei Huo, Hairong Zhao |
Coordinated scheduling of production and delivery with production window and delivery capacity constraints. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nuttapong Attrapadung, Javier Herranz, Fabien Laguillaumie, Benoît Libert, Elie de Panafieu, Carla Ràfols |
Attribute-based encryption schemes with constant-size ciphertexts. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Harold S. Connamacher |
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Adam J. Friedlander |
Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Travis Gagie, Gonzalo Navarro, Simon J. Puglisi |
New algorithms on wavelet trees and applications to information retrieval. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulio Manzonetto, Paolo Tranquilli |
Strong normalization of MFF via a calculus of coercions. |
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 | Anna A. Gorbenko, Vladimir Yu. Popov |
The set of parameterized k-covers problem. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")