Unveiling Dynamics and Complexity - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319587400, 9783319587417

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Eliminating Unbounded Search in Computable Algebra

Unveiling Dynamics and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-58741-7_8 ◽

2017 ◽

pp. 77-87 ◽

Cited By ~ 1

Author(s):

Alexander G. Melnikov

Keyword(s):

Unbounded Search

Download Full-text

Randomness Deficiencies

Unveiling Dynamics and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-58741-7_32 ◽

2017 ◽

pp. 338-350 ◽

Cited By ~ 1

Author(s):

Gleb Novikov

Download Full-text

A Universal Oracle for Signal Machines

Unveiling Dynamics and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-58741-7_30 ◽

2017 ◽

pp. 315-326

Author(s):

Thierry Monteil

Download Full-text

Formalizing a Fragment of Combinatorics on Words

Unveiling Dynamics and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-58741-7_3 ◽

2017 ◽

pp. 24-31

Author(s):

Štěpán Holub ◽

Robert Veroff

Keyword(s):

Combinatorics On Words

Download Full-text

$$\varSigma ^{\mu }_2$$ is decidable for $$\varPi ^{\mu }_2$$

Unveiling Dynamics and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-58741-7_28 ◽

2017 ◽

pp. 292-303 ◽

Cited By ~ 1

Author(s):

Karoliina Lehtinen ◽

Sandra Quickert

Download Full-text

Counting Substrate Cycles in Topologically Restricted Metabolic Networks

Unveiling Dynamics and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-58741-7_14 ◽

2017 ◽

pp. 129-140

Author(s):

Robert D. Barish ◽

Akira Suyama

Keyword(s):

Metabolic Networks ◽

Substrate Cycles

Download Full-text

A Deterministic Algorithm for Testing the Equivalence of Read-Once Branching Programs with Small Discrepancy

Unveiling Dynamics and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-58741-7_13 ◽

2017 ◽

pp. 119-128

Author(s):

Stefan Arnold ◽

Jacobo Torán

Keyword(s):

Deterministic Algorithm ◽

Branching Programs ◽

Small Discrepancy

Download Full-text

Delayed-Input Cryptographic Protocols

Unveiling Dynamics and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-58741-7_12 ◽

2017 ◽

pp. 112-115

Author(s):

Ivan Visconti

Keyword(s):

Cryptographic Protocols

Download Full-text

Formulas with Reversal

Unveiling Dynamics and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-58741-7_10 ◽

2017 ◽

pp. 98-100 ◽

Cited By ~ 1

Author(s):

Narad Rampersad

Download Full-text

Surjective H-Colouring: New Hardness Results

Unveiling Dynamics and Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-319-58741-7_26 ◽

2017 ◽

pp. 270-281 ◽

Cited By ~ 1

Author(s):

Petr A. Golovach ◽

Matthew Johnson ◽

Barnaby Martin ◽

Daniël Paulusma ◽

Anthony Stewart

Download Full-text

Unveiling Dynamics and Complexity - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Eliminating Unbounded Search in Computable Algebra

Randomness Deficiencies

A Universal Oracle for Signal Machines

Formalizing a Fragment of Combinatorics on Words

$$\varSigma ^{\mu }_2$$ is decidable for $$\varPi ^{\mu }_2$$

Counting Substrate Cycles in Topologically Restricted Metabolic Networks

A Deterministic Algorithm for Testing the Equivalence of Read-Once Branching Programs with Small Discrepancy

Delayed-Input Cryptographic Protocols

Formulas with Reversal

Surjective H-Colouring: New Hardness Results

Unveiling Dynamics and Complexity - Lecture Notes in Computer Science
Latest Publications