Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 312
Volume 312, Number 1, 26 January 2004
- Stephan J. Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo
:
Preface. 1-2 - Moses Charikar, Kevin C. Chen, Martin Farach-Colton:
Finding frequent items in data streams. 3-15 - Lars Engebretsen, Jonas Holmerin, Alexander Russell:
Inapproximability results for equations over finite groups. 17-45 - Seth Pettie:
A new approach to all-pairs shortest paths on real-weighted graphs. 47-74 - Tomasz Radzik:
Improving time bounds on maximum generalised flow computations by contracting the network. 75-97 - Keye Martin, Michael W. Mislove, James Worrell:
Measuring the probabilistic powerdomain. 99-119 - C.-H. Luke Ong, Pietro Di Gianantonio:
Games characterizing Levy-Longo trees. 121-142
Volume 312, Numbers 2-3, 30 January 2004
- Rudolf Freund, Carlos Martín-Vide, Gheorghe Paun:
From regulated rewriting to computing with membranes: collapsing hierarchies. 143-188 - Nageswara S. V. Rao:
Probabilistic quickest path algorithm. 189-201 - Véronique Terrier:
Two-dimensional cellular automata and their neighborhoods. 203-222 - Stéphane Vialette:
On the computational complexity of 2-interval pattern matching problems. 223-249 - Kosaburo Hashiguchi, Naoto Sakakibara, Shuji Jimbo:
Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids. 251-266 - Yoshiyuki Karuno, Hiroshi Nagamochi:
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times. 267-280 - Zhang Yi:
Global exponential convergence of recurrent neural networks with variable delays. 281-293 - Pierluigi Frisco:
The conformon-P system: a molecular and cell biology-inspired computability model. 295-319 - Chuan-Kun Wu, Ed Dawson:
Correlation immunity and resiliency of symmetric Boolean functions. 321-335 - Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Computing the similarity of two sequences with nested arc annotations. 337-358 - Oscar H. Ibarra, Zhe Dang:
On two-way FA with monotonic counters and quadratic Diophantine equations. 359-378 - Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu:
Catalytic P systems, semilinear sets, and vector addition systems. 379-399 - Michel Habib, Lhouari Nourine, Olivier Raynaud, Eric Thierry:
Computational aspects of the 2-dimension of partially ordered sets. 401-431 - Antonio Cano Gómez, Jean-Eric Pin:
Shuffle on positive varieties of languages. 433-461 - Benjamin Doerr:
Typical rounding problems. 463-477 - Daowen Qiu, Mingsheng Ying:
Characterizations of quantum automata. 479-489
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-04-22 20:59 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:
