Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 491
Volume 491, June 2013
- Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff:
Exact symbolic-numeric computation of planar algebraic curves. 1-32 - Anton Cerný:
On Prouhet's solution to the equal powers problem. 33-46 - Daniel Krenn
:
Analysis of the width-ww non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices. 47-70 - Eddie Cheng, Shalin Shah, Vyom Shah, Daniel E. Steffy:
Strong matching preclusion for augmented cubes. 71-77 - Yuxing Yang, Shiying Wang:
Fault-free Hamiltonian cycles passing through a linear forest in ternary nn-cubes with faulty edges. 78-82 - Jae Woo Seo, Dae Hyun Yum, Pil Joong Lee:
Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles. 83-93 - Jianming Dong, An Zhang, Yong Chen, Qifan Yang:
Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination. 94-102 - Shurong Zhang, Shiying Wang:
Many-to-many disjoint path covers in kk-ary nn-cubes. 103-118 - Jing Jin, Baogang Xu, Xiaoyan Zhang:
On the complexity of injective colorings and its generalizations. 119-126 - Xiao Yin, Daming Zhu:
Sorting genomes by generalized translocations. 127-135
- Tamir Tassa:
Addendum to "Finding all maximally-matchable edges in a bipartite graph" [Theoret. Comput. Sci. 423 (2012) 50-58]. 136
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 21:54 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:
