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 International Publishing

9783319060880, 9783319060897

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Bit-Encoding Phase Selection Strategy for Satisfiability Solvers

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

10.1007/978-3-319-06089-7_11 ◽

2014 ◽

pp. 158-167 ◽

Cited By ~ 5

Author(s):

Jingchao Chen

Keyword(s):

Selection Strategy ◽

Phase Selection ◽

Satisfiability Solvers

Download Full-text

Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems

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

10.1007/978-3-319-06089-7_17 ◽

2014 ◽

pp. 248-258 ◽

Cited By ~ 6

Author(s):

Min Lu ◽

Tian Liu ◽

Weitian Tong ◽

Guohui Lin ◽

Ke Xu

Keyword(s):

Set Cover ◽

Set Packing ◽

Hitting Set ◽

Set Systems

Download Full-text

Reversibility of Elementary Cellular Automata under Fully Asynchronous Update

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

10.1007/978-3-319-06089-7_4 ◽

2014 ◽

pp. 39-49 ◽

Cited By ~ 9

Author(s):

Biswanath Sethi ◽

Nazim Fatès ◽

Sukanta Das

Keyword(s):

Cellular Automata ◽

Elementary Cellular Automata

Download Full-text

A Local-Global Approach to Solving Ideal Lattice Problems

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

10.1007/978-3-319-06089-7_27 ◽

2014 ◽

pp. 378-400

Author(s):

Yuan Tian ◽

Rongxin Sun ◽

Xueyong Zhu

Keyword(s):

Ideal Lattice ◽

Global Approach

Download Full-text

Space Complexity of Optimization Problems in Planar Graphs

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

10.1007/978-3-319-06089-7_21 ◽

2014 ◽

pp. 300-311

Author(s):

Samir Datta ◽

Raghav Kulkarni

Keyword(s):

Planar Graphs ◽

Optimization Problems ◽

Space Complexity

Download Full-text

The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes

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

10.1007/978-3-319-06089-7_7 ◽

2014 ◽

pp. 86-103 ◽

Cited By ~ 2

Author(s):

David Cattanéo ◽

Simon Perdrix

Keyword(s):

Parameterized Complexity ◽

Linear Codes

Download Full-text

Finite State Incompressible Infinite Sequences

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

10.1007/978-3-319-06089-7_5 ◽

2014 ◽

pp. 50-66

Author(s):

Cristian S. Calude ◽

Ludwig Staiger ◽

Frank Stephan

Keyword(s):

Finite State ◽

Infinite Sequences

Download Full-text

An Improved Upper-Bound for Rivest et al.’s Half-Lie Problem

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

10.1007/978-3-319-06089-7_3 ◽

2014 ◽

pp. 23-38

Author(s):

Bala Ravikumar ◽

Duncan Innes

Keyword(s):

Upper Bound

Download Full-text

Modular Form Approach to Solving Lattice Problems

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

10.1007/978-3-319-06089-7_28 ◽

2014 ◽

pp. 401-421

Author(s):

Yuan Tian ◽

Xueyong Zhu ◽

Rongxin Sun

Keyword(s):

Modular Form ◽

Form Approach

Download Full-text

Self-stabilizing Minimal Global Offensive Alliance Algorithm with Safe Convergence in an Arbitrary Graph

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

10.1007/978-3-319-06089-7_26 ◽

2014 ◽

pp. 366-377 ◽

Cited By ~ 3

Author(s):

Yihua Ding ◽

James Z. Wang ◽

Pradip K. Srimani

Keyword(s):

Arbitrary Graph

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

A Bit-Encoding Phase Selection Strategy for Satisfiability Solvers

Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems

Reversibility of Elementary Cellular Automata under Fully Asynchronous Update

A Local-Global Approach to Solving Ideal Lattice Problems

Space Complexity of Optimization Problems in Planar Graphs

The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes

Finite State Incompressible Infinite Sequences

An Improved Upper-Bound for Rivest et al.’s Half-Lie Problem

Modular Form Approach to Solving Lattice Problems

Self-stabilizing Minimal Global Offensive Alliance Algorithm with Safe Convergence in an Arbitrary Graph

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