Algorithms and Complexity (Record no. 86054)

000 -LEADER
fixed length control field 05309nam a22005895i 4500
001 - CONTROL NUMBER
control field 978-3-031-30448-4
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730165025.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 230424s2023 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783031304484
-- 978-3-031-30448-4
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-031-30448-4
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA9.58
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM014000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.13
Edition number 23
245 10 - TITLE STATEMENT
Title Algorithms and Complexity
Medium [electronic resource] :
Remainder of title 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings /
Statement of responsibility, etc. edited by Marios Mavronicolas.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2023.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Cham :
Name of producer, publisher, distributor, manufacturer Springer International Publishing :
-- Imprint: Springer,
Date of production, publication, distribution, manufacture, or copyright notice 2023.
300 ## - PHYSICAL DESCRIPTION
Extent XI, 400 p. 90 illus., 45 illus. in color.
Other physical details online resource.
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 1611-3349 ;
Volume/sequential designation 13898
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Unifying 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.
520 ## - SUMMARY, ETC.
Summary, etc. This book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 13-16, 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
9 (RLIN) 3390
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer graphics.
9 (RLIN) 4088
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science
General subdivision Mathematics.
9 (RLIN) 3866
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer systems.
9 (RLIN) 87128
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Artificial intelligence.
9 (RLIN) 3407
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Design and Analysis of Algorithms.
9 (RLIN) 31835
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Graphics.
9 (RLIN) 4088
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Symbolic and Algebraic Manipulation.
9 (RLIN) 55589
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer System Implementation.
9 (RLIN) 38514
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Artificial Intelligence.
9 (RLIN) 3407
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Mavronicolas, Marios.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
9 (RLIN) 87133
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
9 (RLIN) 87135
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783031304477
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed edition:
International Standard Book Number 9783031304491
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
International Standard Serial Number 1611-3349 ;
Volume/sequential designation 13898
9 (RLIN) 23263
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-031-30448-4">https://doi.org/10.1007/978-3-031-30448-4</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-Lecture Notes in CS

No items available.