default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 332
Volume 332, Number 1-3, February 2005
- Andrew Lim
, Brian Rodrigues, Fan Wang, Zhou Xu:
k-Center problems with minimum coverage. 1-17 - Alain Daurat:
Determination of Q-convex sets by X-rays. 19-45 - Lila Kari, Petr Sosík:
Aspects of shuffle and deletion on trajectories. 47-61 - Steven S. Seiden, Peter P. Chen, Robert F. Lax, Jianhua Chen, Guoli Ding:
New bounds for randomized busing. 63-81 - Marc Demange, Vangelis Th. Paschos:
On-line vertex-covering. 83-108 - Qingmin Shi, Joseph F. JáJá:
A new framework for addressing temporal range queries and some preliminary results. 109-121 - Maria J. Serna, Luca Trevisan, Fatos Xhafa:
The approximability of non-Boolean satisfiability problems and restricted integer programming. 123-139 - Sylvain Lombardy, Jacques Sakarovitch:
Derivatives of rational expressions with multiplicity. 141-177 - Jean Berstel, Luc Boasson, Michel Latteux:
Mixed languages. 179-198 - Franz-Josef Brandenburg, Konstantin Skodinis:
Finite graph automata for linear and boundary graph languages. 199-232 - Salvatore La Torre, Aniello Murano, Margherita Napoli:
Weak Muller acceptance conditions for tree automata. 233-250 - Bernhard Fuchs, Winfried Hochstättler, Walter Kern:
Online matching on a line. 251-264 - Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström:
Counting models for 2SAT and 3SAT formulae. 265-291 - Nikola Jevtic, Alon Orlitsky, Narayana P. Santhanam:
A lower bound on compression of unknown alphabets. 293-311 - Marco Pedicini:
Greedy expansions and sets with deleted digits. 313-336 - Klaus Weihrauch, Ning Zhong:
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing. 337-366 - A. Cincotti:
Three-player partizan games. 367-389 - Longtao He, Binxing Fang, Jie Sui:
The wide window string matching algorithm. 391-404 - Jean Cardinal, Stefan Langerman:
Designing small keyboards is hard. 405-415 - Hiroshi Nagamochi:
On the one-sided crossing minimization in a bipartite graph with large degrees. 417-446 - Hong-Gwa Yeh, Xuding Zhu:
Resource-sharing system scheduling and circular chromatic number. 447-460 - H. J. Huang, Li Jiao, To-Yat Cheung:
Property-preserving subnet reductions for designing manufacturing systems with shared resources. 461-485 - Harumichi Nishimura, Masanao Ozawa:
Uniformity of quantum circuit families for error-free algorithms. 487-496 - Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière:
On the differential approximation of MIN SET COVER. 497-513 - Jesper Makholm Byskov, Bolette Ammitzbøll Madsen, Bjarke Skjernaa:
New algorithms for Exact Satisfiability. 515-541 - Reza Gharavi, Venkat Anantharam:
An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices. 543-557 - Dekel Tsur:
Sequencing by hybridization with errors: handling longer sequences. 559-566 - Maxime Crochemore, Jacques Désarménien, Dominique Perrin:
A note on the Burrows - CWheeler transformation. 567-572 - Ali Aberkane, James D. Currie:
The Thue-Morse word contains circular 5/2+ power free words of every length. 573-581
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-11-28 23:54 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:
