![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 374
Volume 374, Numbers 1-3, April 2007
- Masahiko Murakami
, Masao Hara, Makoto Yamamoto, Seiichi Tani:
Fast algorithms for computing Jones polynomials of certain links. 1-24 - Samuel Nicolay, Michel Rigo
:
About frequencies of letters in generalized automatic sequences. 25-40 - Biao Wu, Enyue Yao:
k-Partitioning problems with partition matroid constraint. 41-48 - Ji Tian, Ruyan Fu, Jinjiang Yuan:
On-line scheduling with delivery time on a single batch machine. 49-57 - Jamie Simpson:
Intersecting periodic words. 58-65 - Yongxi Cheng:
Lattice grids and prisms are antimagic. 66-73 - Erzsébet Csuhaj-Varjú, Ion Petre
, György Vaszil:
Self-assembly of strings and languages. 74-81 - Gerard J. Chang
, Sen-Peng Eu
, Chung-Heng Yeh:
On the (n, t)-antipodal Gray codes. 82-90 - Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi
:
The maximum agreement forest problem: Approximation algorithms and computational experiments. 91-110 - Niklas Eriksen:
Reversal and transposition medians. 111-126 - Dietrich Kuske:
Weighted asynchronous cellular automata. 127-148 - Noga Alon, Andrzej Lingas, Martin Wahlen:
Approximating the maximum clique minor and some subgraph homeomorphism problems. 149-158 - L. L. Liu, C. T. Ng
, T. C. Edwin Cheng
:
Scheduling jobs with agreeable processing times and due dates on a single batch processing machine. 159-169 - Jun-Ho Her, R. S. Ramakrishna:
An external-memory depth-first search algorithm for general grid graphs. 170-180 - Qiqi Yan:
Classifying regular languages by a split game. 181-190 - Wenbin Chen, Jiangtao Meng:
Hardness of approximating the Minimum Solutions of Linear Diophantine Equations. 191-195 - Ruyan Fu, Ji Tian, Jinjiang Yuan, Yixun Lin:
Online scheduling in a parallel batch processing system to minimize makespan using restarts. 196-202 - Rastislav Kralovic
, Peter Ruzicka:
Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing. 203-213 - Ina Mäurer:
Characterizations of recognizable picture series. 214-228 - Dario Catalano, Ivan Visconti:
Hybrid commitments and their applications to zero-knowledge proof systems. 229-260 - Stelvio Cimato
, Roberto De Prisco
, Alfredo De Santis
:
Colored visual cryptography without color darkening. 261-276 - Jerzy Mycka, José Félix Costa
:
A new conceptual framework for analog computation. 277-290
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.