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

TOTAL DOCUMENTS

64

(FIVE YEARS 0)

H-INDEX

17

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642029264, 9783642029271

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Amortized Communication Complexity of Distributions

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

10.1007/978-3-642-02927-1_61 ◽

2009 ◽

pp. 738-749 ◽

Author(s):

Jérémie Roland ◽

Mario Szegedy

Keyword(s):

Communication Complexity

Download Full-text

A Fast and Simple Parallel Algorithm for the Monotone Duality Problem

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

10.1007/978-3-642-02927-1_17 ◽

2009 ◽

pp. 183-194 ◽

Author(s):

Endre Boros ◽

Kazuhisa Makino

Keyword(s):

Parallel Algorithm ◽

Duality Problem

Download Full-text

General Scheme for Perfect Quantum Network Coding with Free Classical Communication

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

10.1007/978-3-642-02927-1_52 ◽

2009 ◽

pp. 622-633 ◽

Author(s):

Hirotada Kobayashi ◽

François Le Gall ◽

Harumichi Nishimura ◽

Martin Rötteler

Keyword(s):

Network Coding ◽

General Scheme ◽

Quantum Network ◽

Classical Communication ◽

Quantum Network Coding

Download Full-text

A 3/2-Approximation Algorithm for General Stable Marriage

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

10.1007/978-3-642-02927-1_57 ◽

2009 ◽

pp. 689-700 ◽

Author(s):

Eric McDermid

Keyword(s):

Approximation Algorithm ◽

Stable Marriage

Download Full-text

On Cartesian Trees and Range Minimum Queries

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

10.1007/978-3-642-02927-1_29 ◽

2009 ◽

pp. 341-353 ◽

Author(s):

Erik D. Demaine ◽

Gad M. Landau ◽

Oren Weimann

Download Full-text

Factoring Groups Efficiently

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

10.1007/978-3-642-02927-1_49 ◽

2009 ◽

pp. 585-596 ◽

Author(s):

Neeraj Kayal ◽

Timur Nezhmetdinov

Download Full-text

Dynamic Succinct Ordered Trees

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

10.1007/978-3-642-02927-1_37 ◽

2009 ◽

pp. 439-450 ◽

Author(s):

Arash Farzan ◽

J. Ian Munro

Keyword(s):

Download Full-text

Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs

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

10.1007/978-3-642-02927-1_27 ◽

2009 ◽

pp. 316-327 ◽

Author(s):

Erik D. Demaine ◽

MohammadTaghi Hajiaghayi ◽

Ken-ichi Kawarabayashi

Keyword(s):

Approximation Algorithms ◽

Minor Free Graphs

Download Full-text

Bounds on the Size of Small Depth Circuits for Approximating Majority

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

10.1007/978-3-642-02927-1_7 ◽

2009 ◽

pp. 59-70 ◽

Author(s):

Kazuyuki Amano

Keyword(s):

Download Full-text

Distortion Is Fixed Parameter Tractable

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

10.1007/978-3-642-02927-1_39 ◽

2009 ◽

pp. 463-474 ◽

Author(s):

Michael R. Fellows ◽

Fedor V. Fomin ◽

Daniel Lokshtanov ◽

Elena Losievskaja ◽

Frances A. Rosamond ◽

...

Keyword(s):

Fixed Parameter Tractable ◽

Fixed Parameter

Download Full-text