UB Paderborn / Katalog / Suche / in CDI

Foundations of Software Technology and Theoretical Computer Science: 11th Conference, New Delhi, India December 17–19, 1991 Proceedings

1991

Volltextzugriff (PDF)

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume

2014, 2014

Volltextzugriff (PDF)

Efficacy of the Metropolis Algorithm for the Minimum-Weight Codeword Problem Using Codeword and Generator Search Spaces

IEEE transactions on evolutionary computation, 2020-08, Vol.24 (4), p.664-678

2020

Volltextzugriff (PDF)

Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm

Information processing letters, 2012-12, Vol.112 (23), p.922-927

2012

Volltextzugriff (PDF)

Primality and identity testing via Chinese remaindering

Journal of the ACM, 2003-07, Vol.50 (4), p.429-443

2003

Volltextzugriff (PDF)

Evolution and similarity evaluation of protein structures in contact map space

Proteins, structure, function, and bioinformatics, 2005-05, Vol.59 (2), p.196-204

2005

Volltextzugriff (PDF)

Modeling Gene Regulatory Network in Fission Yeast Cell Cycle Using Hybrid Petri Nets

Lecture notes in computer science, 2004, p.1310-1315

2004

Volltextzugriff (PDF)

Padding, commitment and self-reducibility

Theoretical computer science, 1991-04, Vol.81 (2), p.189-199

1991

Volltextzugriff (PDF)

The structure and complexity of minimal NFA's over a unary alphabet

Foundations of Software Technology and Theoretical Computer Science, 2005, p.152-171

2005

Volltextzugriff (PDF)

Computing the order of a locally testable automaton

Foundations of Software Technology and Theoretical Computer Science, 2005, p.186-211

2005

Volltextzugriff (PDF)

Failures semantics for a simple process language with refinement

Foundations of Software Technology and Theoretical Computer Science, 2005, p.89-108

2005

Volltextzugriff (PDF)

Program checking

Foundations of Software Technology and Theoretical Computer Science, 2005, p.1-9

2005

Volltextzugriff (PDF)

Uniform circuits and exclusive read PRAMs

Foundations of Software Technology and Theoretical Computer Science, 2005, p.307-318

2005

Volltextzugriff (PDF)

A fast algorithm for the principal partition of a graph

Foundations of Software Technology and Theoretical Computer Science, 2005, p.288-306

2005

Volltextzugriff (PDF)

Computing the shortest path tree in a weak visibility polygon

Foundations of Software Technology and Theoretical Computer Science, 2005, p.369-389

2005

Volltextzugriff (PDF)

Time analysis, cost equivalence and program refinement

Foundations of Software Technology and Theoretical Computer Science, 2005, p.25-39

2005

Volltextzugriff (PDF)

Fast deterministic selection on mesh-connected processor arrays

Foundations of Software Technology and Theoretical Computer Science, 2005, p.336-346

2005

Volltextzugriff (PDF)

Fast stable in-place sorting with O(n) data moves

Foundations of Software Technology and Theoretical Computer Science, 2005, p.266-277

2005

Volltextzugriff (PDF)

Tense logics for local reasoning in distributed systems

Foundations of Software Technology and Theoretical Computer Science, 2005, p.71-88

2005

Volltextzugriff (PDF)

Usefulness of angle-sweep over line-sweep

Foundations of Software Technology and Theoretical Computer Science, 2005, p.390-419

2005

Volltextzugriff (PDF)

Correctness of programs over poor signatures

Foundations of Software Technology and Theoretical Computer Science, 2005, p.109-120

2005

Volltextzugriff (PDF)

Complete problems involving boolean labelled structures and projection translations

Foundations of Software Technology and Theoretical Computer Science, 2005, p.242-260

2005

Volltextzugriff (PDF)

Contracting planar graphs efficiently in parallel

Foundations of Software Technology and Theoretical Computer Science, 2005, p.319-335

2005

Volltextzugriff (PDF)

NP-hard sets and creativeness over constant time languages

Foundations of Software Technology and Theoretical Computer Science, 2005, p.224-241

2005

Volltextzugriff (PDF)

Designing secure communication protocols from trust specifications

Foundations of Software Technology and Theoretical Computer Science, 2005, p.360-368

2005

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Foundations of Software Technology and Theoretical Computer Science: 11th Conference, New Delhi, India December 17–19, 1991 Proceedings

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume

Efficacy of the Metropolis Algorithm for the Minimum-Weight Codeword Problem Using Codeword and Generator Search Spaces

Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm

Primality and identity testing via Chinese remaindering

Evolution and similarity evaluation of protein structures in contact map space

Modeling Gene Regulatory Network in Fission Yeast Cell Cycle Using Hybrid Petri Nets

Padding, commitment and self-reducibility

The structure and complexity of minimal NFA's over a unary alphabet

Computing the order of a locally testable automaton

Failures semantics for a simple process language with refinement

Program checking

Uniform circuits and exclusive read PRAMs

A fast algorithm for the principal partition of a graph

Computing the shortest path tree in a weak visibility polygon

Time analysis, cost equivalence and program refinement

Fast deterministic selection on mesh-connected processor arrays

Fast stable in-place sorting with O(n) data moves

Tense logics for local reasoning in distributed systems

Usefulness of angle-sweep over line-sweep

Correctness of programs over poor signatures

Complete problems involving boolean labelled structures and projection translations

Contracting planar graphs efficiently in parallel

NP-hard sets and creativeness over constant time languages

Designing secure communication protocols from trust specifications

Suchergebnisse filtern