Muutke küpsiste eelistusi

E-raamat: Algorithms and Complexity: 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings

Edited by
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 80,26 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Algorithms and Complexity: 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, ProceedingsSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.

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.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830313044846e.html
Märksõnad: