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

TOTAL DOCUMENTS

28

(FIVE YEARS 28)

H-INDEX

0

(FIVE YEARS 0)

Published By Springer International Publishing

9783030794156, 9783030794163

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximation and Complexity of the Capacitated Geometric Median Problem

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

10.1007/978-3-030-79416-3_26 ◽

2021 ◽

pp. 422-434

Author(s):

Vladimir Shenmaier

Keyword(s):

Download Full-text

Computational Complexity of Multi-player Evolutionarily Stable Strategies

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

10.1007/978-3-030-79416-3_1 ◽

2021 ◽

pp. 1-17

Author(s):

Manon Blanc ◽

Kristoffer Arnsfelt Hansen

Keyword(s):

Computational Complexity ◽

Evolutionarily Stable Strategies ◽

Evolutionarily Stable

Download Full-text

Real $$\tau $$-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization

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

10.1007/978-3-030-79416-3_5 ◽

2021 ◽

pp. 78-101

Author(s):

Pranjal Dutta

Keyword(s):

Lower Bound ◽

Sum Of Squares ◽

Unified Approach

Download Full-text

A Generic Convolution Algorithm for Join Operations on Tree Decompositions

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

10.1007/978-3-030-79416-3_27 ◽

2021 ◽

pp. 435-459

Author(s):

Johan M. M. van Rooij

Keyword(s):

Convolution Algorithm ◽

Tree Decompositions

Download Full-text

Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection

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

10.1007/978-3-030-79416-3_12 ◽

2021 ◽

pp. 206-222

Author(s):

Florent Koechlin ◽

Pablo Rotondo

Keyword(s):

Regular Expressions ◽

Reduction Algorithm ◽

Efficient Reduction

Download Full-text

On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs

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

10.1007/978-3-030-79416-3_20 ◽

2021 ◽

pp. 339-348

Author(s):

Zeev Nutov

Download Full-text

Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata

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

10.1007/978-3-030-79416-3_18 ◽

2021 ◽

pp. 296-320

Author(s):

Augusto Modanese

Keyword(s):

Cellular Automata ◽

Download Full-text

On Separation Between the Degree of a Boolean Function and the Block Sensitivity

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

10.1007/978-3-030-79416-3_25 ◽

2021 ◽

pp. 406-421

Author(s):

Nikolay V. Proskurin

Keyword(s):

Boolean Function ◽

Block Sensitivity

Download Full-text

Upper Bounds on Communication in Terms of Approximate Rank

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

10.1007/978-3-030-79416-3_7 ◽

2021 ◽

pp. 116-130

Author(s):

Anna Gál ◽

Ridwan Syed

Keyword(s):

Download Full-text

On the Computational Complexity of Reaction Systems, Revisited

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

10.1007/978-3-030-79416-3_10 ◽

2021 ◽

pp. 170-185

Author(s):

Markus Holzer ◽

Christian Rauch

Keyword(s):

Computational Complexity ◽

Reaction Systems

Download Full-text