default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 595
Volume 595, August 2015
- Tim Smith
:
On infinite words determined by L systems. 1-10 - Anna Bernasconi, Valentina Ciriani, Lorenzo Lago:
On the error resilience of ordered binary decision diagrams. 11-33 - Luciana Vitale, Alvaro Martín, Gadiel Seroussi:
Space-efficient representation of truncated suffix trees, with applications to Markov order estimation. 34-45 - Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online dynamic power management with hard real-time guarantees. 46-64 - Wenyu Hu, Xingjun Luo, Zhongxuan Luo:
A unified approach to computing the nearest complex polynomial with a given zero. 65-81 - Jianxin Wang, Weimin Su, Min Yang, Jiong Guo, Qilong Feng, Feng Shi, Jianer Chen:
Parameterized complexity of control and bribery for d-approval elections. 82-91 - Annie Chateau, Rodolphe Giroudeau:
A complexity and approximation framework for the maximization scaffolding problem. 92-106 - Jørgen Bang-Jensen, Anders Yeo:
Balanced branchings in digraphs. 107-119 - Xian Qiu, Walter Kern:
Improved approximation algorithms for a bilevel knapsack problem. 120-129 - Farnoosh Khodakarami, Farzad Didehvar, Ali Mohades:
A fixed-parameter algorithm for guarding 1.5D terrains. 130-142 - Yujue Wang, Duncan S. Wong, Qianhong Wu, Sherman S. M. Chow, Bo Qin, Jianwei Liu, Yong Ding:
Practical (fully) distributed signatures provably secure in the standard model. 143-158 - Gabriel Renault, Simon Schmidt:
On the complexity of the misère version of three games played on graphs. 159-167
- Micheal Arockiaraj, Arul Jeya Shalini:
Conjectures on wirelength of hypercube into cylinder and torus. 168-171
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 2025-12-04 22:08 CET 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:
