![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 172
Volume 172, Numbers 1-2, 10 February 1997
- Jeff Edmonds:
Removing Ramsey Theory: Lower Bounds With Smaller Domain Size. 1-41
- Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann:
PAC-Learning from General Examples. 43-65 - Isabelle Fagnot:
Sur les facteurs des mots automatiques. 67-89 - Bruno Apolloni, S. Chiaravalli:
PAC Learning of Concept Classes Through the Boundaries of Their Items. 91-120 - Eric Goles Ch., Maurice Margenstern:
Universality of the Chip-Firing Game. 121-134 - W. G. Handley:
Deterministic summation modulo B_n, the Semigroup of Binary Relations on {0, 1, ..., n-1}. 135-174 - Goos Kant, Xin He:
Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems. 175-193 - Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng:
Resource Bounded Randomness and Weakly Complete Problems. 195-207 - Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai:
Homogeneously Orderable Graphs. 209-232 - Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos:
Fugitive-Search Games on Graphs and Related Parameters. 233-254
- Jean-Christophe Hohl:
Massively Parallel Factorizations of Polynomials With Many Non-Commuting Variables. 255-263 - Shinichi Shimozono:
Finding Optimal Subgraphs by Local Search. 265-271 - Igor Rystsov:
Reset Words for Commutative and Solvable Automata. 273-279 - Costas S. Iliopoulos, Dennis W. G. Moore, William F. Smyth:
A Characterization of the Squares in a Fibonacci String. 281-291 - Petr Savický, Stanislav Zák:
A Lower Bound on Branching Programs Reading Some Bits Twice. 293-301 - Günter Rote:
Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m. 303-308 - Hendrik Jan Hoogeboom, Anca Muscholl:
The Code Problem for Traces - Improving the Boundaries. 309-321
![](https://dblp1.uni-trier.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.