Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 262
Volume 262, Number 1-2, July 2001
- Juraj Hromkovic, Georg Schnitger:
On the power of Las Vegas II: Two-way finite automata. 1-24 - Stepan Holub:
Local and global cyclicity in free semigroups. 25-36 - David Lee, Henryk Wozniakowski:
Approximate evaluations of characteristic polynomials of Boolean functions. 37-68 - Alberto Bertoni, Marco Carpentieri:
Analogies and differences between quantum and stochastic automata. 69-81 - Donghui Chen, Ding-Zhu Du, Xiao-Dong Hu, Guo-Hui Lin, Lusheng Wang
, Guoliang Xue:
Approximations for Steiner trees with minimum number of Steiner points. 83-99 - Ming-Yang Kao, Jie Wang:
Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees. 101-115 - Satoshi Kobayashi, Victor Mitrana, Gheorghe Paun, Grzegorz Rozenberg:
Formal properties of PA-matching. 117-131 - K. Kalorkoti, D. H. Tulley:
Priority queues with binary priorities. 133-144 - Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne:
Approximations for the general block distribution of a matrix. 145-160 - Bhaskar DasGupta, Eduardo D. Sontag:
A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems. 161-189 - Oliver Jenkinson:
Strong cocycle triviality for Z2 subshifts. 191-213 - Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho:
Longest fault-free paths in star graphs with vertex faults. 215-227 - G. Dányi, Zoltán Fülöp:
The component hierarchy of chain-free cooperating distributed regular tree grammars. 229-240 - Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer:
Hyper-polynomial hierarchies and the polynomial jump. 241-256 - Bing Lu, Jun Gu, Xiao-Dong Hu, Eugene Shragowitz:
Wire segmenting for buffer insertion based on RSTP-MSP. 257-267 - Jean-Pierre Duval, Filippo Mignosi, Antonio Restivo:
Recurrence and periodicity in infinite words from local periods. 269-284 - Ekkart Kindler, Hagen Völzer:
Algebraic nets with flexible arcs. 285-310 - Enno Ohlebusch:
Implementing conditional term rewriting by graph rewriting. 311-331 - Nguyen Huong Lam:
Finite maximal solid codes. 333-347 - Doris Fiebig, Ulf-Rainer Fiebig, Natasa Jonoska:
Multiplicities of covers for sofic shifts. 349-375 - Frank Drewes:
Tree-based generation of languages of fractals. 377-414 - Heejin Park, Kunsoo Park:
Parallel algorithms for red-black trees. 415-435 - Steven S. Seiden:
Preemptive multiprocessor scheduling with rejection. 437-458 - Siu-Wing Cheng, Yin-Feng Xu:
On beta-skeleton as a subgraph of the minimum weight triangulation. 459-471 - Dieter Spreen:
Representations versus numberings: on the relationship of two computability notions. 473-499 - Bernd Borchert, Riccardo Silvestri:
Dot operators. 501-523 - Matthieu Latapy, Roberto Mantaci, Michel Morvan, Ha Duong Phan:
Structure of some sand piles model. 525-556 - Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth:
Approximate periods of strings. 557-568 - Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito:
Efficient web searching using temporal factors. 569-582 - Yuji Kobayashi, Masashi Katsura, Kayoko Shikishima-Tsuji:
Termination and derivational complexity of confluent one-rule string-rewriting systems. 583-632 - Yasuhiko Takenaga, Kouji Nakajima, Shuzo Yajima:
Tree-shellability of Boolean functions. 633-647 - Jeannette C. M. Janssen, Lata Narayanan:
Approximation algorithms for channel assignment with constraints. 649-667 - Olivier Finkel:
Topological properties of omega context-free languages. 669-697
a service of 
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 2024-05-13 20:15 CEST 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:
