This book constitutes the proceedings of the 23rd International Symposium on Fundamentals of Computation Theory, FCT 2021, held in Athens, Greece, in September 2021. The 30 full papers included in this volume were carefully reviewed and selected from 94 submissions. In addition, the book contains 2 invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.

Produktinformation

Utgivningsdatum:2021-09-12
Mått:155 x 235 x 27 mm
Vikt:744 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:476
Förlag:Springer Nature Switzerland AG
ISBN:9783030865924

Utforska kategorier

Innehållsförteckning

Invited papers.- Two sided matching markets with strongly correlated random preferences.- Communicating Finite state machines and an extensible toolchain for multiparty session types.- Contributed papers.- First-Order logic and its Infinitary Quantifier Extensions over Countable Words.- From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization.- A Poly-Log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider.- Computational Complexity of Covering Disconnected Multigraphs.- The Complexity of Bicriteria Tree-depth.- TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs.- Bipartite 3-Regular Counting Problems with Mixed Signs.- The Satisfiability Problem for a Quantitative Fragment of PCTL.- Beyond the BEST Theorem: Fast Assessment of Eulerian Trails.- Regular Model Checking with Regular Relations.- Minimum Consistent Subset of Trees.- Parameterized Complexity of Finding Subgraphs with Hereditary Properties onHereditary Graph Classes.- The Space Complexity of Sum Labelling.- On Minimizing Regular Expressions Without Kleene Star.- Computational Complexity of Computing a Quasi-Proper Equilibrium.- Computational Complexity of Synchronization under Sparse Regular Constraints.- On Dasgupta’s hierarchical clustering objective and its relation to other graph parameter.- Mengerian Temporal Graphs Revisited.- Faster FPT Algorithms for Deletion to Pairs of Graph Classes.- Fast Algorithms for the Rooted Triplet Distance Between Caterpillars.- Deciding Top-Down Determinism of Regular Tree Languages.- Propositional Gossip Protocols.- Complexity of word problems for HNN-extensions.- On Finding Separators in Temporal Split and Permutation Graphs.- The Possible Winner Problem with Uncertain Weights Revisited.- Streaming Deletion Problems Parameterized by Vertex Cover.- On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits.- Concentration of Collision Estimator.- Valency-based Consensus under Message Adversaries without Limit-Closure.

Mer från samma författare

Approximation and Online Algorithms

Evripidis Bampis, Nicole Megow

Häftad, 2020

642 kr

Approximation and Online Algorithms

Nicole Megow, Evripidis Bampis

E-bok

2020

797 kr

Fundamentals of Computation Theory

Aris Pagourtzis, Evripidis Bampis

E-bok

2021

1 296 kr

Del 8952

Approximation and Online Algorithms

Evripidis Bampis, Ola Svensson

Häftad, 2015

533 kr

Approximation and Online Algorithms

Ola Svensson, Evripidis Bampis

E-bok

2015

638 kr

Del 9125

Experimental Algorithms

Evripidis Bampis

Häftad, 2015

554 kr

Experimental Algorithms

Evripidis Bampis

E-bok

2015

718 kr

Efficient Approximation and Online Algorithms

Evripidis Bampis, Klaus Jansen, Claire Kenyon

Häftad, 2006

571 kr

Efficient Approximation and Online Algorithms

Claire Kenyon, Klaus Jansen, Evripidis Bampis

E-bok

2006

718 kr

Approximation and Online Algorithms

Evripidis Bampis, Martin Skutella

Häftad, 2009

571 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

554 kr

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang - Knowledge Graphs, Häftad

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

932 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

571 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

571 kr

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson - Advanced Parallel Processing Technologies, Häftad

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 022 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

932 kr

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek - Electronic Participation, Häftad

Nyhet

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

730 kr

Del 12051

Sustainable Digital Communities

Anneli Sundqvist, Gerd Berget, Jan Nolin, Kjell Ivar Skjerdingstad

Häftad, 2020

1 071 kr

Types for Proofs and Programs

Thierry Coquand, Peter Dybjer, Bengt Nordström, Jan Smith

Häftad, 2000

571 kr

Del 13216

Requirements Engineering: Foundation for Software Quality

Vincenzo Gervasi, Andreas Vogelsang

Häftad, 2022

627 kr

Du kanske också är intresserad av

10% rabatt på allt

L'amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

Fundamentals of Computation Theory

Aris Pagourtzis, Evripidis Bampis

E-bok

2021

1 296 kr

Fundamentals of Computation Theory

Lothar Budach, Rais G. Bukharajev, Oleg B. Lupanov

Häftad, 1987

556 kr

Fundamentals of Computation Theory

Horst Reichel

Häftad, 1995

571 kr

Del 11651

Fundamentals of Computation Theory

Leszek Antoni Gąsieniec, Jesper Jansson, Christos Levcopoulos

Häftad, 2019

554 kr

Fundamentals of Computation Theory

Andrzej Lingas, Bengt J. Nilsson

Häftad, 2003

571 kr

Fundamentals of Computation Theory

F. Gecseg

Häftad, 1981

556 kr

Fundamentals of Computation Theory

Olaf Owe, Martin Steffen, Jan Arne Telle

Häftad, 2011

554 kr

Fundamentals of Computation Theory

Marek Karpinski

Häftad, 1977

556 kr

Del 14292

Fundamentals of Computation Theory

Henning Fernau, Klaus Jansen

Häftad, 2023

909 kr

Fundamentals of Computation Theory

23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings

AvEvripidis Bampis,Aris Pagourtzis

Häftad, Engelska, 2021

Del 12867 i serien Lecture Notes in Computer Science

1 022 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

554 kr

909 kr

842 kr

556 kr

556 kr

538 kr

556 kr

571 kr

571 kr

571 kr

Beskrivning

Produktinformation

Utgivningsdatum:2021-09-12
Mått:155 x 235 x 27 mm
Vikt:744 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:476
Förlag:Springer Nature Switzerland AG
ISBN:9783030865924

Utforska kategorier

Innehållsförteckning

Invited papers.- Two sided matching markets with strongly correlated random preferences.- Communicating Finite state machines and an extensible toolchain for multiparty session types.- Contributed papers.- First-Order logic and its Infinitary Quantifier Extensions over Countable Words.- From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization.- A Poly-Log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider.- Computational Complexity of Covering Disconnected Multigraphs.- The Complexity of Bicriteria Tree-depth.- TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs.- Bipartite 3-Regular Counting Problems with Mixed Signs.- The Satisfiability Problem for a Quantitative Fragment of PCTL.- Beyond the BEST Theorem: Fast Assessment of Eulerian Trails.- Regular Model Checking with Regular Relations.- Minimum Consistent Subset of Trees.- Parameterized Complexity of Finding Subgraphs with Hereditary Properties onHereditary Graph Classes.- The Space Complexity of Sum Labelling.- On Minimizing Regular Expressions Without Kleene Star.- Computational Complexity of Computing a Quasi-Proper Equilibrium.- Computational Complexity of Synchronization under Sparse Regular Constraints.- On Dasgupta’s hierarchical clustering objective and its relation to other graph parameter.- Mengerian Temporal Graphs Revisited.- Faster FPT Algorithms for Deletion to Pairs of Graph Classes.- Fast Algorithms for the Rooted Triplet Distance Between Caterpillars.- Deciding Top-Down Determinism of Regular Tree Languages.- Propositional Gossip Protocols.- Complexity of word problems for HNN-extensions.- On Finding Separators in Temporal Split and Permutation Graphs.- The Possible Winner Problem with Uncertain Weights Revisited.- Streaming Deletion Problems Parameterized by Vertex Cover.- On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits.- Concentration of Collision Estimator.- Valency-based Consensus under Message Adversaries without Limit-Closure.

Mer från samma författare

Approximation and Online Algorithms

Evripidis Bampis, Nicole Megow

Häftad, 2020

642 kr

Approximation and Online Algorithms

Nicole Megow, Evripidis Bampis

E-bok

2020

797 kr

Fundamentals of Computation Theory

Aris Pagourtzis, Evripidis Bampis

E-bok

2021

1 296 kr

Del 8952

Approximation and Online Algorithms

Evripidis Bampis, Ola Svensson

Häftad, 2015

533 kr

Approximation and Online Algorithms

Ola Svensson, Evripidis Bampis

E-bok

2015

638 kr

Del 9125

Experimental Algorithms

Evripidis Bampis

Häftad, 2015

554 kr

Experimental Algorithms

Evripidis Bampis

E-bok

2015

718 kr

Efficient Approximation and Online Algorithms

Evripidis Bampis, Klaus Jansen, Claire Kenyon

Häftad, 2006

571 kr

Efficient Approximation and Online Algorithms

Claire Kenyon, Klaus Jansen, Evripidis Bampis

E-bok

2006

718 kr

Approximation and Online Algorithms

Evripidis Bampis, Martin Skutella

Häftad, 2009

571 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

554 kr

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

932 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

571 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

571 kr

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 022 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

932 kr

Nyhet

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

730 kr

Del 12051