Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=501
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the weak computability of a four dimensional orthogonal packing and time scheduling problem
Wenqi Huang
,
Kun He
Theoretical Computer Science
501
, 2013, pp. 1-10
On the open problem of Ginsburg concerning semilinear sets and related problems
Oscar H. Ibarra
,
Shinnosuke Seki
Theoretical Computer Science
501
, 2013, pp. 11-19
Linear circuits, two-variable logic and weakly blocked monoids
Christoph Behle
,
Andreas Krebs
,
Mark Mercer
Theoretical Computer Science
501
, 2013, pp. 20-33
On excessive index of certain networks
Indra Rajasingh
,
R. Bharati
,
Albert Muthumalai
,
A.S. Shanthi
Theoretical Computer Science
501
, 2013, pp. 34-40
The total run length of a word
Amy Glen
,
Jamie Simpson
Theoretical Computer Science
501
, 2013, pp. 41-48
On using probabilistic Turing machines to model participants in cryptographic protocols
Lee Klingler
,
Rainer Steinwandt
,
Dominique Unruh
Theoretical Computer Science
501
, 2013, pp. 49-51
An analysis of chain characteristics in the cryptanalytic TMTO method
Violeta Tomas̑ević
,
Milo Tomas̑ević
Theoretical Computer Science
501
, 2013, pp. 52-61
Fault isolation and identification in general biswapped networks under the PMC diagnostic model
Chang-Hsiung Tsai
,
Jheng-Cheng Chen
Theoretical Computer Science
501
, 2013, pp. 62-71
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
Nodari Vakhania
,
Frank Werner
Theoretical Computer Science
501
, 2013, pp. 72-81
Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras
C.J. van Alten
Theoretical Computer Science
501
, 2013, pp. 82-92
Conditional Kolmogorov complexity and universal probability
Paul M.B. Vitányi
Theoretical Computer Science
501
, 2013, pp. 93-100
One-round multi-party communication complexity of distinguishing sums
Daniel Apon
,
Jonathan Katz
,
Alex J. Malozemoff
Theoretical Computer Science
501
, 2013, pp. 101-108