Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 118
Volume 118, February 2017
- Yi-Jun Chang
, Hsu-Chun Yen:
Area-universal drawings of biconnected outerplane graphs. 1-5 - Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard. 6-9 - Khaled M. Elbassioni, Trung Thanh Nguyen:
A polynomial-time algorithm for computing low CP-rank decompositions. 10-14 - Jesper Nederlof:
A short note on Merlin-Arthur protocols for subset sum. 15-16 - Thorsten Ehlers:
Merging almost sorted sequences yields a 24-sorter. 17-20 - Minjia Shi, Liqin Qian, Yan Liu, Patrick Solé:
Good self-dual generalized quasi-cyclic codes exist. 21-24 - Shahram Khazaei, Siavash Ahmadi:
Ciphertext-only attack on d × d Hill in O(d13d). 25-29 - Felipe A. Louza, Simon Gog, Guilherme P. Telles:
Optimal suffix sorting and LCP array construction for constant alphabets. 30-34 - Stéphane Gaubert, Zheng Qu:
Checking strict positivity of Kraus maps is NP-hard. 35-43 - Slawomir Lasota:
Equivariant algorithms for constraint satisfaction problems over coset templates. 44-52 - Yuri Grinberg, Theodore J. Perkins:
Fully polynomial-time computation of maximum likelihood trajectories in Markov chains. 53-57 - Guilhem Gamard, Gwénaël Richomme, Jeffrey O. Shallit, Taylor J. Smith:
Periodicity in rectangular arrays. 58-63 - Zuosong Liang, Erfang Shan, Liying Kang:
The clique-transversal set problem in {claw, K4}-free planar graphs. 64-68 - Fabio Gadducci, Francesco Santini:
Residuation for bipolar preferences in soft constraints. 69-74 - Robert Mercas, Dirk Nowotka:
A note on Thue games. 75-77 - Marius Nicolae, Sanguthevar Rajasekaran:
On pattern matching with k mismatches and few don't cares. 78-82 - Sen Su, Sen Zhao, Xiang Cheng, Rong Bi, Xin Cao, Jie Wang:
Group-based collective keyword querying in road networks. 83-90 - Guillermo A. Pérez:
The fixed initial credit problem for partial-observation energy games is Ack-complete. 91-99 - Christian Fernández-Campusano, Mikel Larrea, Roberto Cortiñas, Michel Raynal:
A distributed leader election algorithm in crash-recovery and omissive systems. 100-104 - Chang-Hsiung Tsai, Jheng-Cheng Chen:
Diagnosable evaluation of enhanced optical transpose interconnection system networks. 105-109 - Min Li, Q. Liu:
Inexact feasibility pump for mixed integer nonlinear programming. 110-116 - Peter Damaschke:
Refined algorithms for hitting many intervals. 117-122
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-06-26 21:20 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:
