default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 501
Volume 501, August 2013
- Wenqi Huang, Kun He:
On the weak computability of a four dimensional orthogonal packing and time scheduling problem. 1-10 - Oscar H. Ibarra, Shinnosuke Seki:
On the open problem of Ginsburg concerning semilinear sets and related problems. 11-19 - Christoph Behle, Andreas Krebs, Mark Mercer:
Linear circuits, two-variable logic and weakly blocked monoids. 20-33 - Indra Rajasingh, Bharati Rajan, Albert Muthumalai, A. S. Shanthi:
On excessive index of certain networks. 34-40 - Amy Glen, Jamie Simpson:
The total run length of a word. 41-48 - Lee Klingler, Rainer Steinwandt, Dominique Unruh
:
On using probabilistic Turing machines to model participants in cryptographic protocols. 49-51 - Violeta Tomasevic, Milo Tomasevic:
An analysis of chain characteristics in the cryptanalytic TMTO method. 52-61 - Chang-Hsiung Tsai, Jheng-Cheng Chen:
Fault isolation and identification in general biswapped networks under the PMC diagnostic model. 62-71 - Nodari Vakhania, Frank Werner:
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time. 72-81 - Clint J. van Alten:
Partial algebras and complexity of satisfiability and universal theory for distributive lattices, boolean algebras and Heyting algebras. 82-92 - Paul M. B. Vitányi:
Conditional Kolmogorov complexity and universal probability. 93-100
- Daniel Apon, Jonathan Katz, Alex J. Malozemoff:
One-round multi-party communication complexity of distinguishing sums. 101-108
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-09-18 23:40 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:
