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

9783319587462, 9783319587479

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Generalized Dyck Shifts

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

10.1007/978-3-319-58747-9_11 ◽

2017 ◽

pp. 99-111

Author(s):

Marie-Pierre Béal ◽

Pavel Heller

Edit Distance Neighbourhoods of Input-Driven Pushdown Automata

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

10.1007/978-3-319-58747-9_23 ◽

2017 ◽

pp. 260-272 ◽

Cited By ~ 4

Author(s):

Alexander Okhotin ◽

Kai Salomaa

Keyword(s):

Edit Distance ◽

Pushdown Automata

Nondeterministic Unitary OBDDs

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

10.1007/978-3-319-58747-9_13 ◽

2017 ◽

pp. 126-140 ◽

Cited By ~ 5

Author(s):

Aida Gainutdinova ◽

Abuzer Yakaryılmaz

Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams

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

10.1007/978-3-319-58747-9_16 ◽

2017 ◽

pp. 162-175 ◽

Cited By ~ 10

Author(s):

Kamil Khadiev ◽

Aliya Khadieva

Keyword(s):

Binary Decision Diagrams ◽

Decision Diagrams ◽

Ordered Binary Decision Diagrams ◽

Binary Decision

Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs

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

10.1007/978-3-319-58747-9_4 ◽

2017 ◽

pp. 20-24 ◽

Cited By ~ 2

Author(s):

Andrew McGregor

Keyword(s):

New Approaches ◽

Massive Graphs

On a Generalization of Horn Constraint Systems

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

10.1007/978-3-319-58747-9_28 ◽

2017 ◽

pp. 323-336

Author(s):

Piotr Wojciechowski ◽

R. Chandrasekaran ◽

K. Subramani

Keyword(s):

Constraint Systems

Dag-Like Communication and Its Applications

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

10.1007/978-3-319-58747-9_26 ◽

2017 ◽

pp. 294-307 ◽

Cited By ~ 5

Author(s):

Dmitry Sokolov

The Descriptive Complexity of Subgraph Isomorphism Without Numerics

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

10.1007/978-3-319-58747-9_27 ◽

2017 ◽

pp. 308-322 ◽

Cited By ~ 1

Author(s):

Oleg Verbitsky ◽

Maksim Zhukovskii

Keyword(s):

Subgraph Isomorphism ◽

Descriptive Complexity

The (Minimum) Rank of Typical Fooling-Set Matrices

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

10.1007/978-3-319-58747-9_24 ◽

2017 ◽

pp. 273-284

Author(s):

Mozhgan Pourmoradnasseri ◽

Dirk Oliver Theis

Keyword(s):

Minimum Rank

Can We Locally Compute Sparse Connected Subgraphs?

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

10.1007/978-3-319-58747-9_6 ◽

2017 ◽

pp. 38-47

Author(s):

Ronitt Rubinfeld

Keyword(s):

Connected Subgraphs

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Generalized Dyck Shifts

Edit Distance Neighbourhoods of Input-Driven Pushdown Automata

Nondeterministic Unitary OBDDs

Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams

Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs

On a Generalization of Horn Constraint Systems

Dag-Like Communication and Its Applications

The Descriptive Complexity of Subgraph Isomorphism Without Numerics

The (Minimum) Rank of Typical Fooling-Set Matrices

Can We Locally Compute Sparse Connected Subgraphs?

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