Automata, Languages, and Programming - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783662476710, 9783662476727

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Uniform Kernelization Complexity of Hitting Forbidden Minors

Automata, Languages, and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-662-47672-7_51 ◽

2015 ◽

pp. 629-641 ◽

Cited By ~ 7

Author(s):

Archontia C. Giannopoulou ◽

Bart M. P. Jansen ◽

Daniel Lokshtanov ◽

Saket Saurabh

Keyword(s):

Forbidden Minors

Download Full-text

A $$(2+\epsilon )$$ ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem

Automata, Languages, and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-662-47672-7_79 ◽

2015 ◽

pp. 973-984 ◽

Cited By ~ 3

Author(s):

Tobias Mömke ◽

Andreas Wiese

Keyword(s):

Approximation Algorithm ◽

Allocation Problem ◽

Storage Allocation

Download Full-text

Serving in the Dark should be done Non-Uniformly

Automata, Languages, and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-662-47672-7_8 ◽

2015 ◽

pp. 91-102 ◽

Cited By ~ 2

Author(s):

Yossi Azar ◽

Ilan Reuven Cohen

Download Full-text

Amplification of One-Way Information Complexity via Codes and Noise Sensitivity

Automata, Languages, and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-662-47672-7_78 ◽

2015 ◽

pp. 960-972

Author(s):

Marco Molinaro ◽

David P. Woodruff ◽

Grigory Yaroslavtsev

Keyword(s):

Noise Sensitivity ◽

Information Complexity

Download Full-text

A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set

Automata, Languages, and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-662-47672-7_64 ◽

2015 ◽

pp. 785-796

Author(s):

Marek Karpinski ◽

Andrzej Lingas ◽

Dzmitry Sledneu

Keyword(s):

Planar Point ◽

Point Set

Download Full-text

Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$ # BIS -Hard

Automata, Languages, and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-662-47672-7_43 ◽

2015 ◽

pp. 529-541

Author(s):

Andreas Galanis ◽

Leslie Ann Goldberg ◽

Mark Jerrum

Download Full-text

A Galois Connection for Valued Constraint Languages of Infinite Size

Automata, Languages, and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-662-47672-7_42 ◽

2015 ◽

pp. 517-528 ◽

Cited By ~ 3

Author(s):

Peter Fulla ◽

Stanislav Živný

Keyword(s):

Galois Connection ◽

Constraint Languages

Download Full-text

Local Reductions

Automata, Languages, and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-662-47672-7_61 ◽

2015 ◽

pp. 749-760 ◽

Cited By ~ 5

Author(s):

Hamid Jahanjou ◽

Eric Miles ◽

Emanuele Viola

Download Full-text

Query Complexity in Expectation

Automata, Languages, and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-662-47672-7_62 ◽

2015 ◽

pp. 761-772 ◽

Cited By ~ 1

Author(s):

Jedrzej Kaniewski ◽

Troy Lee ◽

Ronald de Wolf

Keyword(s):

Query Complexity

Download Full-text

Replacing Mark Bits with Randomness in Fibonacci Heaps

Automata, Languages, and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-662-47672-7_72 ◽

2015 ◽

pp. 886-897

Author(s):

Jerry Li ◽

John Peebles

Download Full-text

Automata, Languages, and Programming - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Uniform Kernelization Complexity of Hitting Forbidden Minors

A $$(2+\epsilon )$$ ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem

Serving in the Dark should be done Non-Uniformly

Amplification of One-Way Information Complexity via Codes and Noise Sensitivity

A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set

Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$ # BIS -Hard

A Galois Connection for Valued Constraint Languages of Infinite Size

Local Reductions

Query Complexity in Expectation

Replacing Mark Bits with Randomness in Fibonacci Heaps

Automata, Languages, and Programming - Lecture Notes in Computer Science
Latest Publications