


default search action
Theoretical Computer Science, Volume 592
Volume 592, August 2015
- Jacob Chodoriwsky, Lucia Moura

:
An adaptive algorithm for group testing for complexes. 1-8 - Hwee Kim, Yo-Sub Han:

Non-overlapping inversion on strings and languages. 9-22 - Yuichi Kamiya, Tatsuya Okada, Takeshi Sekiguchi, Yasunobu Shiota:

Power and exponential sums for generalized coding systems by a measure theoretic approach. 23-38 - Wanbin Son, Sang Won Bae

, Hee-Kap Ahn
:
Group nearest-neighbor queries in the L1 plane. 39-48 - Serge Gaspers

, Mikko Koivisto
, Mathieu Liedloff, Sebastian Ordyniak
, Stefan Szeider
:
On finding optimal polytrees. 49-58 - Richard Beal, Donald A. Adjeroh:

Efficient pattern matching for RNA secondary structures. 59-71 - Jos W. H. M. Uiterwijk

, Michael Barton
:
New results for Domineering from combinatorial game theory endgame databases. 72-86 - Alessandro Conflitti

, Ricardo Mamede
:
Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions. 87-96 - Rishiraj Bhattacharyya

, Pratyay Mukherjee
:
Non-adaptive programmability of random oracle. 97-114 - Artur Jez

:
Approximation of grammar-based compression via recompression. 115-134 - Danny Ziyi Chen, Jian Li

, Haitao Wang:
Efficient algorithms for the one-dimensional k-center problem. 135-142 - Dario Catalano, Dario Fiore, Rosario Gennaro, Konstantinos Vamvourellis:

Algebraic (trapdoor) one-way functions: Constructions and applications. 143-165 - Erfang Shan, Liying Kang

:
Coloring clique-hypergraphs of graphs with no subdivision of K5. 166-175

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














