國立高雄大學圖資館 |

Language: English

Back

Fundamentals of computation theory22...

(1998 :)

Fundamentals of computation theory22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Fundamentals of computation theoryedited by Leszek Antoni Gasieniec, Jesper Jansson, Christos Levcopoulos.
Reminder of title:	22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019 : proceedings /
remainder title:	FCT 2019
other author:	Gasieniec, Leszek Antoni.
corporate name:
Published:	Cham :Springer International Publishing :2019.
Description:	xiii, 365 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Computer science
Online resource:	https://doi.org/10.1007/978-3-030-25027-0
ISBN:	9783030250270$q(electronic bk.)

Fundamentals of computation theory22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019 : proceedings /
Fundamentals of computation theory22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019 : proceedings /[electronic resource] :FCT 2019edited by Leszek Antoni Gasieniec, Jesper Jansson, Christos Levcopoulos. - Cham :Springer International Publishing :2019. - xiii, 365 p. :ill., digital ;24 cm. - Lecture notes in computer science,116510302-9743 ;. - Lecture notes in computer science ;4891..

Invited papers -- Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps -- Some Observations on Dynamic Random Walks and Network Renormalization -- Highly Succinct Dynamic Data Structures -- Formal methods -- Largest Common Prefix of a Regular Tree Language -- Winning Strategies for Streaming Rewriting Games -- Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting -- Two characterizations of finite-state dimension -- Complexity -- Optimal channel utilization with limited feedback -- Deterministic Preparation of Dicke States -- Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle -- On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties -- Algorithms -- An Efficient Algorithm for the Fast Delivery Problem -- Extension of some edge graph problems: standard and parameterized complexity -- Space Efficient Algorithms for Breadth-Depth Search -- Circular Pattern Matching with k Mismatches -- Succinct Representations of Finite Groups -- On the Tractability of Covering a Graph with 2-Clubs -- On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest -- Maximum rectilinear convex subsets -- Computing Digraph Width Measures on Directed Co-Graphs -- Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel -- Rare Siblings Speed-up Deterministic Detection and Counting of Small Pattern Graphs -- Bivariate B-splines from convex pseudo-circle configurations -- The Fault-Tolerant Metric Dimension of Cographs.

This book constitutes the proceedings of the 22nd International Symposium on Fundamentals of Computation Theory, FCT 2019, held in Copenhagen, Denmark, in August 2019. The 21 full papers included in this volume were carefully reviewed and selected from 45 submissions. In addition, the book contains 3 invited talks in full-paper length. The papers were organized in topical sections named: formal methods, complexity, and algorithms.

ISBN: 9783030250270$q(electronic bk.)

Standard No.: 10.1007/978-3-030-25027-0doiSubjects--Topical Terms:

252805
Computer science

LC Class. No.: QA75.5 / .F38 2019

Dewey Class. No.: 004

Fundamentals of computation theory22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019 : proceedings /
LDR:03262nmm a2200361 a 4500 001 563729
003 DE-He213
005 20190709171150.0
006 m d
007 cr nn 008maaau
008 200311s2019 gw s 0 eng d
020 $a 9783030250270$q(electronic bk.)
020 $a 9783030250263$q(paper)
024 7 $a 10.1007/978-3-030-25027-0 $2 doi
035 $a 978-3-030-25027-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA75.5 $b .F38 2019
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 004 $2 23
090 $a QA75.5 $b .F287 2019
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Fundamentals of computation theory $h [electronic resource] : $b 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019 : proceedings / $c edited by Leszek Antoni Gasieniec, Jesper Jansson, Christos Levcopoulos.
246 3 $a FCT 2019
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xiii, 365 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11651
490 1 $a Theoretical computer science and general issues
505 0 $a Invited papers -- Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps -- Some Observations on Dynamic Random Walks and Network Renormalization -- Highly Succinct Dynamic Data Structures -- Formal methods -- Largest Common Prefix of a Regular Tree Language -- Winning Strategies for Streaming Rewriting Games -- Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting -- Two characterizations of finite-state dimension -- Complexity -- Optimal channel utilization with limited feedback -- Deterministic Preparation of Dicke States -- Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle -- On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties -- Algorithms -- An Efficient Algorithm for the Fast Delivery Problem -- Extension of some edge graph problems: standard and parameterized complexity -- Space Efficient Algorithms for Breadth-Depth Search -- Circular Pattern Matching with k Mismatches -- Succinct Representations of Finite Groups -- On the Tractability of Covering a Graph with 2-Clubs -- On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest -- Maximum rectilinear convex subsets -- Computing Digraph Width Measures on Directed Co-Graphs -- Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel -- Rare Siblings Speed-up Deterministic Detection and Counting of Small Pattern Graphs -- Bivariate B-splines from convex pseudo-circle configurations -- The Fault-Tolerant Metric Dimension of Cographs.
520 $a This book constitutes the proceedings of the 22nd International Symposium on Fundamentals of Computation Theory, FCT 2019, held in Copenhagen, Denmark, in August 2019. The 21 full papers included in this volume were carefully reviewed and selected from 45 submissions. In addition, the book contains 3 invited talks in full-paper length. The papers were organized in topical sections named: formal methods, complexity, and algorithms.
650 0 $a Computer science $3 252805
650 0 $a Computer science $x Mathematics $3 253427
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Computer Graphics. $3 274515
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Artificial Intelligence. $3 212515
650 2 4 $a Data Structures. $3 273992
650 2 4 $a Computer Communication Networks. $3 218087
700 1 $a Gasieniec, Leszek Antoni. $3 849349
700 1 $a Jansson, Jesper. $3 849350
700 1 $a Levcopoulos, Christos. $3 849351
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-25027-0
950 $a Computer Science (Springer-11645)