Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 362
Volume 362, Numbers 1-3, October 2006
- Nazim Fatès, Eric Thierry, Michel Morvan, Nicolas Schabanel:
Fully asynchronous behavior of double-quiescent elementary cellular automata. 1-16 - Khaled El-Fakih, Nina Yevtushenko, Sergey Buffalov, Gregor von Bochmann:
Progressive solutions to a parallel automata equation. 17-32 - Francesc Rosselló
, Gabriel Valiente:
An algebraic view of the relation between largest common subtrees and smallest common supertrees. 33-53 - Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe:
If P neq NP then some strongly noninvertible functions are invertible. 54-62 - Guizhen Yang:
Computational aspects of mining maximal frequent patterns. 63-85 - Beate Bollig, Stephan Waack, Philipp Woelfel:
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. 86-99 - Pedro García, José Ruiz:
Learning in varieties of the form V*LI from positive data. 100-114 - Min Ji, Yong He, T. C. Edwin Cheng:
Scheduling linear deteriorating jobs with an availability constraint on a single machine. 115-126 - Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk:
The maximum resource bin packing problem. 127-139 - Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini:
Minimal invariant sets in a vertex-weighted graph. 140-161 - Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao:
Improved algorithms for the k maximum-sums problems. 162-170 - Turlough Neary, Damien Woods:
Small fast universal Turing machines. 171-195 - Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin:
Deterministic M2M multicast in radio networks. 196-206 - Matthieu Picantin:
Finite transducers for divisibility monoids. 207-221 - Arto Salomaa:
Independence of certain quantities indicating subword occurrences. 222-231 - Mark Kambites:
Word problems recognisable by deterministic blind monoid automata. 232-237 - Mohamed Eid Hussein, Uwe Schwiegelshohn:
Utilization of nonclairvoyant online schedules. 238-247 - Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot:
Longest repeats with a block of k don't cares. 248-254 - Alain Bretto, Alain Faisant, Thierry Vallée:
Compatible topologies on graphs: An application to graph isomorphism problem complexity. 255-272 - T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. 273-281 - Aldo de Luca, Alessandro De Luca:
Pseudopalindrome closure operators in free monoids. 282-300
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-25 20:49 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:
