Lecture Notes in Computer Science - Theory and Applications of Models of Computation
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642208768, 9783642208775

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-20877-5_39 ◽

2011 ◽

pp. 403-408 ◽

Cited By ~ 2

Author(s):

Ming Lam Leung ◽

Yang Li ◽

Shengyu Zhang

Keyword(s):

Communication Complexity

Download Full-text

An Improved Kernel for Planar Connected Dominating Set

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-20877-5_8 ◽

2011 ◽

pp. 70-81 ◽

Cited By ~ 3

Author(s):

Weizhong Luo ◽

Jianxin Wang ◽

Qilong Feng ◽

Jiong Guo ◽

Jianer Chen

Keyword(s):

Dominating Set ◽

Connected Dominating Set

Download Full-text

Locally Injective Homomorphism to the Simple Weight Graphs

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-20877-5_46 ◽

2011 ◽

pp. 471-482 ◽

Cited By ~ 1

Author(s):

Ondřej Bílka ◽

Bernard Lidický ◽

Marek Tesař

Keyword(s):

Injective Homomorphism

Download Full-text

An Algebraic Characterization of Strictly Piecewise Languages

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-20877-5_26 ◽

2011 ◽

pp. 252-263 ◽

Cited By ~ 4

Author(s):

Jie Fu ◽

Jeffrey Heinz ◽

Herbert G. Tanner

Keyword(s):

Algebraic Characterization

Download Full-text

Approximating Edge Dominating Set in Dense Graphs

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-20877-5_5 ◽

2011 ◽

pp. 37-47

Author(s):

Richard Schmied ◽

Claus Viehmann

Keyword(s):

Dominating Set ◽

Edge Dominating Set ◽

Dense Graphs

Download Full-text

Low Distortion Metric Embedding into Constant Dimension

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-20877-5_12 ◽

2011 ◽

pp. 114-123

Author(s):

András Faragó

Keyword(s):

Metric Embedding ◽

Constant Dimension ◽

Low Distortion

Download Full-text

Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-20877-5_15 ◽

2011 ◽

pp. 142-153

Author(s):

Akiyoshi Shioura ◽

Shunya Suzuki

Keyword(s):

Optimal Allocation ◽

Combinatorial Auctions ◽

Utility Functions ◽

Quadratic Utility

Download Full-text

Lower Bounds for Testing Computability by Small Width OBDDs

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-20877-5_32 ◽

2011 ◽

pp. 320-331 ◽

Cited By ~ 8

Author(s):

Joshua Brody ◽

Kevin Matulef ◽

Chenggang Wu

Keyword(s):

Lower Bounds ◽

Small Width

Download Full-text

Some Tractable Win-Lose Games

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-20877-5_36 ◽

2011 ◽

pp. 365-376 ◽

Cited By ~ 1

Author(s):

Samir Datta ◽

Nagarajan Krishnamurthy

Download Full-text

A Bad Instance for k-Means++

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-642-20877-5_34 ◽

2011 ◽

pp. 344-352 ◽

Cited By ~ 5

Author(s):

Tobias Brunsch ◽

Heiko Röglin

Download Full-text

Lecture Notes in Computer Science - Theory and Applications of Models of ComputationLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models

An Improved Kernel for Planar Connected Dominating Set

Locally Injective Homomorphism to the Simple Weight Graphs

An Algebraic Characterization of Strictly Piecewise Languages

Approximating Edge Dominating Set in Dense Graphs

Low Distortion Metric Embedding into Constant Dimension

Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions

Lower Bounds for Testing Computability by Small Width OBDDs

Some Tractable Win-Lose Games

A Bad Instance for k-Means++

Lecture Notes in Computer Science - Theory and Applications of Models of Computation
Latest Publications