35th Iarcs Annual Conference On Foundations Of Software Technology And Theoretical Computer Science Fsttcs 2015

35th Iarcs Annual Conference On Foundations Of Software Technology And Theoretical Computer Science Fsttcs 2015 Book in PDF, ePub and Kindle version is available to download in english. Read online anytime anywhere directly from your device. Click on the download button below to get a free pdf file of 35th Iarcs Annual Conference On Foundations Of Software Technology And Theoretical Computer Science Fsttcs 2015 book. This book definitely worth reading, it is an incredibly well-written.

IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)

Author : Deepak D'Souza,Telikepalli Kavitha,Jaikumar Radhakrishnan
Publisher : Unknown
Page : 0 pages
File Size : 51,8 Mb
Release : 2012
Category : Electronic
ISBN : 3939897477

Get Book

IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) by Deepak D'Souza,Telikepalli Kavitha,Jaikumar Radhakrishnan Pdf

Computing and Combinatorics

Author : Donghyun Kim,R. N. Uma,Zhipeng Cai,Dong Hoon Lee
Publisher : Springer Nature
Page : 678 pages
File Size : 44,6 Mb
Release : 2020-08-27
Category : Computers
ISBN : 9783030581503

Get Book

Computing and Combinatorics by Donghyun Kim,R. N. Uma,Zhipeng Cai,Dong Hoon Lee Pdf

This book constitutes the proceedings of the 26th International Conference on Computing and Combinatorics, COCOON 2020, held in Atlanta, GA, USA, in August 2020. Due to the COVID-19 pandemic COCOON 2020 was organized as a fully online conference. The 54 papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory.

Handbook of Approximation Algorithms and Metaheuristics

Author : Teofilo F. Gonzalez
Publisher : CRC Press
Page : 798 pages
File Size : 41,8 Mb
Release : 2018-05-15
Category : Computers
ISBN : 9781351236416

Get Book

Handbook of Approximation Algorithms and Metaheuristics by Teofilo F. Gonzalez Pdf

Handbook of Approximation Algorithms and Metaheuristics, Second Edition reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics. Volume 1 of this two-volume set deals primarily with methodologies and traditional applications. It includes restriction, relaxation, local ratio, approximation schemes, randomization, tabu search, evolutionary computation, local search, neural networks, and other metaheuristics. It also explores multi-objective optimization, reoptimization, sensitivity analysis, and stability. Traditional applications covered include: bin packing, multi-dimensional packing, Steiner trees, traveling salesperson, scheduling, and related problems. Volume 2 focuses on the contemporary and emerging applications of methodologies to problems in combinatorial optimization, computational geometry and graphs problems, as well as in large-scale and emerging application areas. It includes approximation algorithms and heuristics for clustering, networks (sensor and wireless), communication, bioinformatics search, streams, virtual communities, and more. About the Editor Teofilo F. Gonzalez is a professor emeritus of computer science at the University of California, Santa Barbara. He completed his Ph.D. in 1975 from the University of Minnesota. He taught at the University of Oklahoma, the Pennsylvania State University, and the University of Texas at Dallas, before joining the UCSB computer science faculty in 1984. He spent sabbatical leaves at the Monterrey Institute of Technology and Higher Education and Utrecht University. He is known for his highly cited pioneering research in the hardness of approximation; for his sublinear and best possible approximation algorithm for k-tMM clustering; for introducing the open-shop scheduling problem as well as algorithms for its solution that have found applications in numerous research areas; as well as for his research on problems in the areas of job scheduling, graph algorithms, computational geometry, message communication, wire routing, etc.

Computing and Software Science

Author : Bernhard Steffen,Gerhard Woeginger
Publisher : Springer Nature
Page : 604 pages
File Size : 55,9 Mb
Release : 2019-10-04
Category : Computers
ISBN : 9783319919089

Get Book

Computing and Software Science by Bernhard Steffen,Gerhard Woeginger Pdf

The papers of this volume focus on the foundational aspects of computer science, the thematic origin and stronghold of LNCS, under the title “Computing and Software Science: State of the Art and Perspectives”. They are organized in two parts: The first part, Computation and Complexity, presents a collection of expository papers on fashionable themes in algorithmics, optimization, and complexity. The second part, Methods, Languages and Tools for Future System Development, aims at sketching the methodological evolution that helps guaranteeing that future systems meet their increasingly critical requirements. Chapter 3 is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Computer Aided Verification

Author : Hana Chockler,Georg Weissenbacher
Publisher : Springer
Page : 703 pages
File Size : 55,9 Mb
Release : 2018-07-21
Category : Computers
ISBN : 9783319961453

Get Book

Computer Aided Verification by Hana Chockler,Georg Weissenbacher Pdf

This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications.

Runtime Verification

Author : Panagiotis Katsaros,Laura Nenzi
Publisher : Springer Nature
Page : 494 pages
File Size : 46,6 Mb
Release : 2023-11-04
Category : Computers
ISBN : 9783031442674

Get Book

Runtime Verification by Panagiotis Katsaros,Laura Nenzi Pdf

This book constitutes the refereed proceedings of the 23rd International Conference on Runtime Verification, RV 2023, held in Thessaloniki, Greece, during October 3–6, 2023. The 13 full papers and 7 short papers presented in this book together with 4 tutorial papers and 2 invited papers were carefully reviewed and selected from 39 submissions. The RV conference is concerned with all aspects of novel lightweight formal methods to monitor, analyze, and guide the runtime behavior of software and hardware systems. Runtime verification techniques are crucial for system correctness, reliability, and robustness; they provide an additional level of rigor and effectiveness compared to conventional testing and are generally more practical than exhaustive formal verification.

Runtime Verification

Author : Bernd Finkbeiner,Leonardo Mariani
Publisher : Springer Nature
Page : 413 pages
File Size : 44,9 Mb
Release : 2019-10-03
Category : Computers
ISBN : 9783030320799

Get Book

Runtime Verification by Bernd Finkbeiner,Leonardo Mariani Pdf

This book constitutes the refereed proceedings of the 19th International Conference on Runtime Verification, RV 2019, held in Porto, Portugal, in October 2019. The 25 regular papers presented in this book were carefully reviewed and selected from 38 submissions. The RV conference is concerned with all aspects of monitoring and analysis of hardware, software and more general system executions. Runtime verification techniques are lightweight techniques to assess system correctness, reliability, and robustness; these techniques are significantly more powerful and versatile than conventional testing, and more practical than exhaustive formal verification. Chapter “Assumption-Based Runtime Verification with Partial Observability and Resets” and chapter “NuRV: a nuXmv Extension for Runtime Verification“ are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Security and Trust Management

Author : Sokratis K. Katsikas,Cristina Alcaraz
Publisher : Springer
Page : 139 pages
File Size : 52,7 Mb
Release : 2018-10-01
Category : Computers
ISBN : 9783030011413

Get Book

Security and Trust Management by Sokratis K. Katsikas,Cristina Alcaraz Pdf

This book constitutes the proceedings of the 14th International Workshop on Security and Trust Management, STM 2018, held in Barcelona, Spain, in September 2018, and co-located with the 23rd European Symposium Research in Computer Security, ESORICS 2018. The 8 full papers were carefully reviewed and selected from 28 submissions. The focus of the workshop was on the following topics: cryptosystems and applied cryptography; modeling and risk assessment; and trust computing.

Computing and Combinatorics

Author : Yixin Cao,Jianer Chen
Publisher : Springer
Page : 708 pages
File Size : 44,7 Mb
Release : 2017-07-25
Category : Computers
ISBN : 9783319623894

Get Book

Computing and Combinatorics by Yixin Cao,Jianer Chen Pdf

This book constitutes the refereed proceedings of the 23rd International Conference on Computing and Combinatorics, COCOON 2017, held in Hiong Kong, China, in August 2017. The 56 full papers papers presented in this book were carefully reviewed and selected from 119 submissions. The papers cover various topics, including algorithms and data structures, complexity theory and computability, algorithmic game theory, computational learning theory, cryptography, computationalbiology, computational geometry and number theory, graph theory, and parallel and distributed computing.

Foundations of Software Science and Computation Structures

Author : Javier Esparza,Andrzej S. Murawski
Publisher : Springer
Page : 568 pages
File Size : 55,5 Mb
Release : 2017-03-15
Category : Computers
ISBN : 9783662544587

Get Book

Foundations of Software Science and Computation Structures by Javier Esparza,Andrzej S. Murawski Pdf

This book constitutes the proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 32 papers presented in this volume were carefully reviewed and selected from 101 submissions. They were organized in topical sections named: coherence spaces and higher-order computation; algebra and coalgebra; games and automata; automata, logic and formal languages; proof theory; probability; concurrency; lambda calculus and constructive proof; and semantics and category theory.

Be sparse! Be dense! Be robust!

Author : Sorge, Manuel
Publisher : Universitätsverlag der TU Berlin
Page : 272 pages
File Size : 41,9 Mb
Release : 2017-05-31
Category : Mathematics
ISBN : 9783798328853

Get Book

Be sparse! Be dense! Be robust! by Sorge, Manuel Pdf

In this thesis we study the computational complexity of five NP-hard graph problems. It is widely accepted that, in general, NP-hard problems cannot be solved efficiently, that is, in polynomial time, due to many unsuccessful attempts to prove the contrary. Hence, we aim to identify properties of the inputs other than their length, that make the problem tractable or intractable. We measure these properties via parameters, mappings that assign to each input a nonnegative integer. For a given parameter k, we then attempt to design fixed-parameter algorithms, algorithms that on input q have running time upper bounded by f(k(q)) * |q|^c , where f is a preferably slowly growing function, |q| is the length of q, and c is a constant, preferably small. In each of the graph problems treated in this thesis, our input represents the setting in which we shall find a solution graph. In addition, the solution graphs shall have a certain property specific to our five graph problems. This property comes in three flavors. First, we look for a graph that shall be sparse! That is, it shall contain few edges. Second, we look for a graph that shall be dense! That is, it shall contain many edges. Third, we look for a graph that shall be robust! That is, it shall remain a good solution, even when it suffers several small modifications. Be sparse! In this part of the thesis, we analyze two similar problems. The input for both of them is a hypergraph H , which consists of a vertex set V and a family E of subsets of V , called hyperedges. The task is to find a support for H , a graph G such that for each hyperedge W in E we have that G[W ] is connected. Motivated by applications in network design, we study SUBSET INTERCONNECTION DESIGN, where we additionally get an integer f , and the support shall contain at most |V| - f + 1 edges. We show that SUBSET INTERCONNECTION DESIGN admits a fixed-parameter algorithm with respect to the number of hyperedges in the input hypergraph, and a fixed-parameter algorithm with respect to f + d , where d is the size of a largest hyperedge. Motivated by an application in hypergraph visualization, we study r-OUTERPLANAR SUPPORT where the support for H shall be r -outerplanar, that is, admit a edge-crossing free embedding in the plane with at most r layers. We show that r-OUTER-PLANAR SUPPORT admits a fixed-parameter algorithm with respect to m + r , where m is the number of hyperedges in the input hypergraph H. Be dense! In this part of the thesis, we study two problems motivated by community detection in social networks. Herein, the input is a graph G and an integer k. We look for a subgraph G' of G containing (exactly) k vertices which adheres to one of two mathematically precise definitions of being dense. In mu-CLIQUE, 0 < mu <= 1, the sought k-vertex subgraph G' should contain at least mu time k choose 2 edges. We study the complexity of mu-CLIQUE with respect to three parameters of the input graph G: the maximum vertex degree delta, h-index h, and degeneracy d. We have delta >= h >= d in every graph and h as well as d assume small values in graphs derived from social networks. For delta and for h, respectively, we obtain fixed-parameter algorithms for mu-CLIQUE and we show that for d + k a fixed-parameter algorithm is unlikely to exist. We prove the positive algorithmic results via developing a general framework for optimizing objective functions over k-vertex subgraphs. In HIGHLY CONNECTED SUBGRAPH we look for a k-vertex subgraph G' in which each vertex shall have degree at least floor(k/2)+1. We analyze a part of the so-called parameter ecology for HIGHLY CONNECTED SUBGRAPH, that is, we navigate the space of possible parameters in a quest to find a reasonable trade-off between small parameter values in practice and efficient running time guarantees. The highlights are that no 2^o(n) * n^c -time algorithms are possible for n-vertex input graphs unless the Exponential Time Hypothesis fails; that there is a O(4^g * n^2)-time algorithm for the number g of edges outgoing from the solution G; and we derive a 2^(O(sqrt(a)log(a)) + a^2nm-time algorithm for the number a of edges not in the solution. Be robust! In this part of the thesis, we study the VECTOR CONNECTIVITY problem, where we are given a graph G, a vertex labeling ell from V(G) to {1, . . . , d }, and an integer k. We are to find a vertex subset S of V(G) of size at most k such that each vertex v in V (G)\S has ell(v) vertex-disjoint paths from v to S in G. Such a set S is useful when placing servers in a network to satisfy robustness-of-service demands. We prove that VECTOR CONNECTIVITY admits a randomized fixed-parameter algorithm with respect to k, that it does not allow a polynomial kernelization with respect to k + d but that, if d is treated as a constant, then it allows a vertex-linear kernelization with respect to k. In dieser Dissertation untersuchen wir die Berechnungskomplexität von fünf NP-schweren Graphproblemen. Es wird weithin angenommen, dass NP-schwere Probleme im Allgemeinen nicht effizient gelöst werden können, das heißt, dass sie keine Polynomialzeitalgorithmen erlauben. Diese Annahme basiert auf vielen bisher nicht erfolgreichen Versuchen das Gegenteil zu beweisen. Aus diesem Grund versuchen wir Eigenschaften der Eingabe herauszuarbeiten, die das betrachtete Problem handhabbar oder unhandhabbar machen. Solche Eigenschaften messen wir mittels Parametern, das heißt, Abbildungen, die jeder möglichen Eingabe eine natürliche Zahl zuordnen. Für einen gegebenen Parameter k versuchen wir dann Fixed-Parameter Algorithmen zu entwerfen, also Algorithmen, die auf Eingabe q eine obere Laufzeitschranke von f(k(q)) * |q|^c erlauben, wobei f eine, vorzugsweise schwach wachsende, Funktion ist, |q| die Länge der Eingabe, und c eine Konstante, vorzugsweise klein. In den Graphproblemen, die wir in dieser Dissertation studieren, repräsentiert unsere Eingabe eine Situation in der wir einen Lösungsgraph finden sollen. Zusätzlich sollen die Lösungsgraphen bestimmte problemspezifische Eigenschaften haben. Wir betrachten drei Varianten dieser Eigenschaften: Zunächst suchen wir einen Graphen, der sparse sein soll. Das heißt, dass er wenige Kanten enthalten soll. Dann suchen wir einen Graphen, der dense sein soll. Das heißt, dass er viele Kanten enthalten soll. Zuletzt suchen wir einen Graphen, der robust sein soll. Das heißt, dass er eine gute Lösung bleiben soll, selbst wenn er einige kleine Modifikationen durchmacht. Be sparse! In diesem Teil der Arbeit analysieren wir zwei ähnliche Probleme. In beiden ist die Eingabe ein Hypergraph H, bestehend aus einer Knotenmenge V und einer Familie E von Teilmengen von V, genannt Hyperkanten. Die Aufgabe ist einen Support für H zu finden, einen Graphen G, sodass für jede Hyperkante W in E der induzierte Teilgraph G[W] verbunden ist. Motiviert durch Anwendungen im Netzwerkdesign betrachten wir SUBSET INTERCONNECTION DESIGN, worin wir eine natürliche Zahl f als zusätzliche Eingabe bekommen, und der Support höchstens |V| - f + 1 Kanten enthalten soll. Wir zeigen, dass SUBSET INTERCONNECTION DESIGN einen Fixed-Parameter Algorithmus in Hinsicht auf die Zahl der Hyperkanten im Eingabegraph erlaubt, und einen Fixed-Parameter Algorithmus in Hinsicht auf f + d, wobei d die Größe einer größten Hyperkante ist. Motiviert durch eine Anwendung in der Hypergraphvisualisierung studieren wir r-OUTERPLANAR SUPPORT, worin der Support für H r-outerplanar sein soll, das heißt, er soll eine kantenkreuzungsfreie Einbettung in die Ebene erlauben mit höchstens r Schichten. Wir zeigen, dass r-OUTERPLANAR SUPPORT einen Fixed-Parameter Algorithmus in Hinsicht auf m + r zulässt, wobei m die Anzahl der Hyperkanten im Eingabehypergraphen H ist. Be dense! In diesem Teil der Arbeit studieren wir zwei Probleme, die durch Community Detection in sozialen Netzwerken motiviert sind. Dabei ist die Eingabe ein Graph G und eine natürliche Zahl k. Wir suchen einen Teilgraphen G' von G, der (genau) k Knoten enthält und dabei eine von zwei mathematisch präzisen Definitionen davon, dense zu sein, aufweist. In mu-CLIQUE, 0 < mu <= 1, soll der gesuchte Teilgraph G' mindestens mu mal k über 2 Kanten enthalten. Wir studieren die Berechnungskomplexität von mu-CLIQUE in Hinsicht auf drei Parameter des Eingabegraphen G: dem maximalen Knotengrad delta, dem h-Index h, und der Degeneracy d. Es gilt delta >= h >= d für jeden Graphen und h als auch d nehmen kleine Werte in Graphen an, die aus sozialen Netzwerken abgeleitet sind. Für delta und h erhalten wir Fixed-Parameter Algorithmen für mu-CLIQUE und wir zeigen, dass für d + k wahrscheinlich kein Fixed-Parameter Algorithmus existiert. Unsere positiven algorithmischen Resultate erhalten wir durch Entwickeln eines allgemeinen Frameworks zum Optimieren von Zielfunktionen über k-Knoten-Teilgraphen. In HIGHLY CONNECTED SUBGRAPH soll in dem gesuchten k-Knoten-Teilgraphen G' jeder Knoten Knotengrad mindestens floor(k/2) + 1 haben. Wir analysieren einen Teil der sogenannten Parameter Ecology für HIGHLY CONNECTED SUBGRAPH. Das heißt, wir navigieren im Raum der möglichen Parameter auf der Suche nach einem vernünftigen Trade-off zwischen kleinen Parameterwerten in der Praxis und effizienten oberen Laufzeitschranken. Die Highlights hier sind, dass es keine Algorithmen mit 2^o(n) * poly(n)-Laufzeit für HIGHLY CONNECTED SUBGRAPH gibt, es sei denn die Exponential Time Hypothesis stimmt nicht; die Entwicklung eines Algorithmus mit O(4^y * n^2 )-Laufzeit, wobei y die Anzahl der Kanten ist, die aus dem Lösungsgraphen G' herausgehen; und die Entwicklung eines Algorithmus mit 2^O(sqrt(a) log(a)) + O(a^2nm)-Laufzeit, wobei a die Anzahl der Kanten ist, die nicht in G' enthalten sind.