default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 583
Volume 583, June 2015
- Adrien Richard
:
Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks. 1-26 - Shu-Ming Sun, Ning Zhong:
Computability aspects for 1st-order partial differential equations via characteristics. 27-39 - Changwook Kim, Mahiro Ando:
Node replacement graph grammars with dynamic node relabeling. 40-50 - Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Finding median in read-only memory on integer input. 51-56 - Shisheng Li, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Single-machine batch scheduling with job processing time compatibility. 57-66 - Youjun Chen, Lingfa Lu, Jinjiang Yuan:
Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time. 67-77 - Pedro García, Damián López, Manuel Vazquez de Parga:
DFA minimization: Double reversal versus split minimization algorithms. 78-85 - Lorenzo De Stefani, Francesco Silvestri:
Exploiting non-constant safe memory in resilient algorithms and data structures. 86-97
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-23 00:32 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:
