


default search action
Theoretical Computer Science, Volume 369
Volume 369, Numbers 1-3, December 2006
- Tomasz Jurdzinski, Frantisek Mráz

, Friedrich Otto, Martin Plátek
:
Degrees of non-monotonicity for restarting automata. 1-34
- Oleg Pikhurko, Jerzy Wojciechowski:

Edge-bandwidth of grids and tori. 35-43 - Jing-Chao Chen:

Efficient sample sort and the average case analysis of PEsort. 44-66 - Henning Bordihn, Henning Fernau

, Markus Holzer
, Vincenzo Manca
, Carlos Martín-Vide:
Iterated sequential transducers as language generating devices. 67-81 - Thomas Eiter, Georg Gottlob

:
Reasoning under minimal upper bounds in propositional logic. 82-115 - Martin Gairing, Thomas Lücking, Marios Mavronicolas

, Burkhard Monien:
The price of anarchy for polynomial social cost. 116-135 - Bang Ye Wu:

On the intercluster distance of a tree metric. 136-141 - Véronique Terrier:

Low complexity classes of multidimensional cellular automata. 142-156 - Eric Angel, Evripidis Bampis

, Fanny Pascual:
Truthful algorithms for scheduling selfish tasks on parallel machines. 157-168 - Carlo Blundo

, Stelvio Cimato
, Alfredo De Santis
:
Visual cryptography schemes with optimal pixel expansion. 169-182 - Michael Domaratzki

, Petr Sosík
, Alfonso Rodríguez-Patón
:
Algebraic properties of substitution on trajectories. 183-196 - Farshad Rostamabadi, Mohammad Ghodsi:

Label updating to avoid point-shaped obstacles in fixed model. 197-210 - Stephen D. Travers:

The complexity of membership problems for circuits over sets of integers. 211-229 - Hans Kellerer, Vitaly A. Strusevich:

A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. 230-238 - Gürkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky

, Joseph H. Nadeau, Süleyman Cenk Sahinalp:
The degree distribution of the generalized duplication model. 239-249 - Jianfeng Hou, Guizhen Liu, Jiansheng Cai:

List edge and list total colorings of planar graphs without 4-cycles. 250-255 - Weigen Yan, Yeong-Nan Yeh:

Enumeration of subtrees of trees. 256-268 - Vittorio Bilò

, Michele Flammini
, Giovanna Melideo, Luca Moscardelli, Alfredo Navarra
:
Sharing the cost of multicast transmissions in wireless networks. 269-284 - Leah Epstein

, Alexander Kesselman:
On the remote server problem or more about TCP acknowledgments. 285-299 - Michael Hoffmann, Richard M. Thomas:

A geometric characterization of automatic semigroups. 300-313 - Wit Forys, Tomasz Krawczyk:

An algorithmic approach to the problem of a semiretract base. 314-322 - Amrinder Arora, Fanchun Jin, Hyeong-Ah Choi:

Scheduling resource allocation with timeslot penalty for changeover. 323-337 - Ronald Koch, Ines Spenke:

Complexity and approximability of k-splittable flows. 338-347 - Shlomi Dolev

, Roberto Segala
, Alexander A. Shvartsman
:
Dynamic load balancing with group communication. 348-360 - Sylvain Pion, Chee-Keng Yap:

Constructive root bound for k-ary rational input numbers. 361-376 - Dany Azriel, Daniel Berend

:
On a question of Leiss regarding the Hanoi Tower problem. 377-383 - Asaf Levin

, Danny Segev:
Partial multicuts in trees. 384-395 - Vicente Acuña, Gilles Didier

, Alejandro Maass
:
Coding with variable block maps. 396-405 - Mário J. J. Branco

:
Two algebraic approaches to variants of the concatenation product. 406-426
- Teofilo F. Gonzalez, David Serena:

Pairwise edge disjoint shortest paths in the n-cube. 427-435 - Lakshmanan Kuppusamy:

A note on ambiguity of internal contextual grammars. 436-441 - Wei-Mei Chen:

Cost distribution of the Chang-Roberts leader election algorithm and related problems. 442-447 - Wenqiang Dai, Yinfeng Xu, Binhai Zhu:

On the edge linfinitf radius of Saitou and Nei's method for phylogenetic reconstruction. 448-455 - Wenbo Zhao, Peng Zhang, Tao Jiang

:
A network flow approach to the Minimum Common Integer Partition Problem. 456-462 - Anahí Gajardo

, Eric Goles Ch.:
Crossing information in two-dimensional Sandpiles. 463-469

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














