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

9783540725039, 9783540725046

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs

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

10.1007/978-3-540-72504-6_69 ◽

2008 ◽

pp. 760-769

Author(s):

Jianxin Wang ◽

Xiaoshuang Xu ◽

Jianer Chen

Keyword(s):

Approximation Algorithm ◽

Bipartite Graphs

Download Full-text

Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures

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

10.1007/978-3-540-72504-6_2 ◽

2007 ◽

pp. 13-33 ◽

Cited By ~ 3

Author(s):

Miklós Ajtai

Keyword(s):

Completeness Theorem ◽

Compactness Theorem ◽

Finite Structures ◽

Gödel’S Completeness Theorem

Download Full-text

Approximation Algorithms for 3D Orthogonal Knapsack

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

10.1007/978-3-540-72504-6_3 ◽

2007 ◽

pp. 34-45 ◽

Cited By ~ 1

Author(s):

Florian Diedrich ◽

Rolf Harren ◽

Klaus Jansen ◽

Ralf Thöle ◽

Henning Thomas

Keyword(s):

Approximation Algorithms

Download Full-text

The Undecidability of the Generalized Collatz Problem

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

10.1007/978-3-540-72504-6_49 ◽

2007 ◽

pp. 542-553 ◽

Cited By ~ 3

Author(s):

Stuart A. Kurtz ◽

Janos Simon

Keyword(s):

Collatz Problem

Download Full-text

Approximation Algorithms for Maximum Edge Coloring Problem

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

10.1007/978-3-540-72504-6_59 ◽

2007 ◽

pp. 646-658 ◽

Cited By ~ 2

Author(s):

Wangsen Feng ◽

Li’ang Zhang ◽

Wanling Qu ◽

Hanpin Wang

Keyword(s):

Approximation Algorithms ◽

Edge Coloring ◽

Coloring Problem

Download Full-text

Absolutely Non-effective Predicates and Functions in Computable Analysis

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

10.1007/978-3-540-72504-6_54 ◽

2007 ◽

pp. 595-604 ◽

Cited By ~ 1

Author(s):

Decheng Ding ◽

Klaus Weihrauch ◽

Yongcheng Wu

Keyword(s):

Computable Analysis

Download Full-text

The Hardness of Selective Network Design for Bottleneck Routing Games

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

10.1007/978-3-540-72504-6_5 ◽

2007 ◽

pp. 58-66 ◽

Cited By ~ 1

Author(s):

Haiyang Hou ◽

Guochuan Zhang

Keyword(s):

Network Design ◽

Routing Games

Download Full-text

A Time Hierarchy Theorem for Nondeterministic Cellular Automata

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

10.1007/978-3-540-72504-6_46 ◽

2007 ◽

pp. 511-520 ◽

Cited By ~ 1

Author(s):

Chuzo Iwamoto ◽

Harumasa Yoneda ◽

Kenichi Morita ◽

Katsunobu Imai

Keyword(s):

Cellular Automata

Download Full-text

Secure Multiparty Computations Using a Dial Lock

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

10.1007/978-3-540-72504-6_45 ◽

2007 ◽

pp. 499-510 ◽

Cited By ~ 3

Author(s):

Takaaki Mizuki ◽

Yoshinori Kugimoto ◽

Hideaki Sone

Download Full-text

Learnable Algorithm on the Continuum

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

10.1007/978-3-540-72504-6_37 ◽

2007 ◽

pp. 408-415

Author(s):

Zhimin Li ◽

Xiang Li

Keyword(s):

The Continuum

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

An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs

Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures

Approximation Algorithms for 3D Orthogonal Knapsack

The Undecidability of the Generalized Collatz Problem

Approximation Algorithms for Maximum Edge Coloring Problem

Absolutely Non-effective Predicates and Functions in Computable Analysis

The Hardness of Selective Network Design for Bottleneck Routing Games

A Time Hierarchy Theorem for Nondeterministic Cellular Automata

Secure Multiparty Computations Using a Dial Lock

Learnable Algorithm on the Continuum

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