001463533 000__ 05567cam\a22006377i\4500
001463533 001__ 1463533
001463533 003__ OCoLC
001463533 005__ 20230601003325.0
001463533 006__ m\\\\\o\\d\\\\\\\\
001463533 007__ cr\cn\nnnunnun
001463533 008__ 230428s2023\\\\sz\\\\\\o\\\\\101\0\eng\d
001463533 019__ $$a1377818448
001463533 020__ $$a3031304489$$qelectronic book
001463533 020__ $$a9783031304484$$q(electronic bk.)
001463533 020__ $$z3031304470
001463533 020__ $$z9783031304477
001463533 0247_ $$a10.1007/978-3-031-30448-4$$2doi
001463533 035__ $$aSP(OCoLC)1377587426
001463533 040__ $$aYDX$$beng$$erda$$cYDX$$dGW5XE$$dEBLCP$$dYDX$$dN$T
001463533 049__ $$aISEA
001463533 050_4 $$aQA76.9.A43$$bI58 2023
001463533 08204 $$a518.1$$223/eng/20230504
001463533 1112_ $$aInternational Conference on Algorithms and Complexity$$n(13th :$$d2023 :$$cLarnaca, Cyprus)
001463533 24510 $$aAlgorithms and complexity :$$b13th international conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, proceedings /$$cMarios Mavronicolas, editor.
001463533 2463_ $$aCIAC 2023
001463533 264_1 $$aCham :$$bSpringer,$$c2023.
001463533 300__ $$a1 online resource
001463533 336__ $$atext$$btxt$$2rdacontent
001463533 337__ $$acomputer$$bc$$2rdamedia
001463533 338__ $$aonline resource$$bcr$$2rdacarrier
001463533 4901_ $$aLecture notes in computer science ;$$v13898
001463533 500__ $$aIncludes author idnex.
001463533 5050_ $$aUnifying Gathering Strategies for Swarms of Mobile Robots -- The Complexity of Secure RAMs -- Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models -- The power of the Binary Value Principle -- Independent Set under a Change Constraint from an Initial Solution -- Asynchronous Fully-Decentralized SGD in the Cluster-Based Model -- Non-Crossing Shortest Paths Lengths in Planar Graphs in Linear Time -- How Vulnerable is an Undirected Planar Graph with respect to Max Flow -- Maximum Flows in Parametric Graph Templates -- Dynamic Coloring on Restricted Graph Classes -- Enumeration of Minimal Tropical Connected Sets -- Dynamic Flows with Time-Dependent Capacities -- On One-Sided Testing Affine Subspaces -- Stable Scheduling in Transactional Memory -- Parameterizing Path Partitions -- Maintaining Triconnected Components under Node Expansion -- Approximating Power Node-Deletion Problems -- Phase transition in count approximation by Count-Min sketch with conservative updates -- Minimum-link $C$-Oriented Paths Visiting a Sequence of Regions in the Plane -- Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond -- Broadcasting in Split Graphs -- Partitioning Subclasses of Chordal Graphs with Few Deletions -- Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision -- Improved Deterministic Leader Election in Diameter-Two Networks -- Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues -- On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves -- Efficiently Enumerating All Spanning Trees of a Plane 3-Tree -- Communication-Efficient Distributed Graph Clustering and Sparsification under Duplication Models.
001463533 506__ $$aAccess limited to authorized users.
001463533 520__ $$aThis book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 1316, 2023. The 25 full papers included in this book were carefully reviewed and selected from 49 submissions. They cover all important areas of research on algorithms and complexity such as algorithm design and analysis; sequential, parallel and distributed algorithms; data structures; computational and structural complexity; lower bounds and limitations of algorithms; randomized and approximation algorithms; parameterized algorithms and parameterized complexity classes; smoothed analysis of algorithms; alternatives to the worst-case analysis of algorithms (e.g., algorithms with predictions), on-line computation and competitive analysis, streaming algorithms, quantum algorithms and complexity, algorithms in algebra, geometry, number theory and combinatorics, computational geometry, algorithmic game theory and mechanism design, algorithmic economics (including auctions and contests), computational learning theory, computational biology and bioinformatics, algorithmic issues in communication networks, algorithms for discrete optimization (including convex optimization) and algorithm engineering.
001463533 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed May 4, 2023).
001463533 650_0 $$aAlgorithms$$vCongresses.
001463533 650_0 $$aComputational complexity$$vCongresses.
001463533 655_0 $$aElectronic books.
001463533 7001_ $$aMavronicolas, Marios.
001463533 77608 $$iPrint version:$$z3031304470$$z9783031304477$$w(OCoLC)1372337036
001463533 830_0 $$aLecture notes in computer science ;$$v13898.
001463533 852__ $$bebk
001463533 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-30448-4$$zOnline Access$$91397441.1
001463533 909CO $$ooai:library.usi.edu:1463533$$pGLOBAL_SET
001463533 980__ $$aBIB
001463533 980__ $$aEBOOK
001463533 982__ $$aEbook
001463533 983__ $$aOnline
001463533 994__ $$a92$$bISE