Computer Science – Theory and Applications - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319341705, 9783319341712

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Hardest Language for Conjunctive Grammars

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-34171-2_24 ◽

2016 ◽

pp. 340-351 ◽

Cited By ~ 2

Author(s):

Alexander Okhotin

Keyword(s):

Conjunctive Grammars

Download Full-text

On Slepian–Wolf Theorem with Interaction

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-34171-2_15 ◽

2016 ◽

pp. 207-222 ◽

Cited By ~ 2

Author(s):

Alexander Kozachinskiy

Download Full-text

Algorithmic Statistics: Normal Objects and Universal Models

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-34171-2_20 ◽

2016 ◽

pp. 280-293 ◽

Cited By ~ 1

Author(s):

Alexey Milovanov

Keyword(s):

Universal Models

Download Full-text

Sums of Read-Once Formulas: How Many Summands Suffice?

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-34171-2_19 ◽

2016 ◽

pp. 266-279

Author(s):

Meena Mahajan ◽

Anuj Tawari

Download Full-text

On Approximating (Connected) 2-Edge Dominating Set by a Tree

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-34171-2_12 ◽

2016 ◽

pp. 161-176

Author(s):

Toshihiro Fujito ◽

Tomoaki Shimoda

Keyword(s):

Dominating Set ◽

Edge Dominating Set

Download Full-text

Depth-4 Identity Testing and Noether’s Normalization Lemma

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-34171-2_22 ◽

2016 ◽

pp. 309-323 ◽

Cited By ~ 1

Author(s):

Partha Mukhopadhyay

Keyword(s):

Identity Testing

Download Full-text

The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-34171-2_17 ◽

2016 ◽

pp. 237-250

Author(s):

Manfred Kufleitner ◽

Jan Philipp Wächter

Keyword(s):

Word Problem

Download Full-text

Prediction of Infinite Words with Automata

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-34171-2_28 ◽

2016 ◽

pp. 394-408

Author(s):

Tim Smith

Keyword(s):

Infinite Words

Download Full-text

Sensitivity Versus Certificate Complexity of Boolean Functions

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-34171-2_2 ◽

2016 ◽

pp. 16-28 ◽

Cited By ~ 4

Author(s):

Andris Ambainis ◽

Krišjānis Prūsis ◽

Jevgēnijs Vihrovs

Keyword(s):

Boolean Functions

Download Full-text

Fourier Sparsity of GF(2) Polynomials

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-34171-2_29 ◽

2016 ◽

pp. 409-424

Author(s):

Hing Yin Tsang ◽

Ning Xie ◽

Shengyu Zhang

Download Full-text

Computer Science – Theory and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

The Hardest Language for Conjunctive Grammars

On Slepian–Wolf Theorem with Interaction

Algorithmic Statistics: Normal Objects and Universal Models

Sums of Read-Once Formulas: How Many Summands Suffice?

On Approximating (Connected) 2-Edge Dominating Set by a Tree

Depth-4 Identity Testing and Noether’s Normalization Lemma

The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy

Prediction of Infinite Words with Automata

Sensitivity Versus Certificate Complexity of Boolean Functions

Fourier Sparsity of GF(2) Polynomials

Computer Science – Theory and Applications - Lecture Notes in Computer Science
Latest Publications