Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 468
Volume 468, January 2013
- Raimundo Briceño, Ivan Rapaport
:
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata. 1-11 - Michelangelo Bucci, Alessandro De Luca, Gabriele Fici:
Enumeration and structure of trapezoidal words. 12-22 - Tiziana Calamoneri, Eugenio Montefusco, Rossella Petreschi, Blerina Sinaimeri:
Exploring pairwise compatibility graphs. 23-36 - Ching-Lueh Chang, Yuh-Dauh Lyuu:
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades. 37-49 - Yebin Chen, Ying Li, Tao Chen:
Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks. 50-58 - J. David, Lhouari Nourine:
A parameterizable enumeration algorithm for sequence mining. 59-68 - Delalleau Guillaume:
Ancestors graph and an upper bound for the subword complexity function. 69-82 - Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo:
On the sensitivity complexity of bipartite graph properties. 83-91 - Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Finding consensus and optimal alignment of circular strings. 92-101 - Chenqi Mou, Dongming Wang, Xiaoliang Li:
Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case. 102-113 - Kejun Zhao, Xiwen Lu:
Approximation schemes for two-agent scheduling on parallel machines. 114-121
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 04:43 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:
