Frontiers of Algorithmics [E-Book] : International Joint Conference, IJTCS-FAW 2021, Beijing, China, August 16-19, 2021, Proceedings / edited by Jing Chen, Minming Li, Guochuan Zhang.
This book constitutes the proceedings of the 15th International Workshop on Frontiers in Algorithmics, FAW 2021, held in conjunction with second International Joint Conference on Theoretical Computer Science (IJTCS 2021), as IJTCS-FAW 2021, in Beijing, China, in August 2021. The conference IJTCS-FAW...
Saved in:
Full text |
|
Personal Name(s): | Chen, Jing, editor |
Li, Minming, editor / Zhang, Guochuan, editor | |
Edition: |
1st edition 2022. |
Imprint: |
Cham :
Springer,
2022
|
Physical Description: |
XXV, 79 pages 9 illustrations (online resource) |
Note: |
englisch |
ISBN: |
9783030970994 |
DOI: |
10.1007/978-3-030-97099-4 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Theoretical Computer Science and General Issues ;
12874 /* Depending on the record driver, $field may either be an array with "name" and "number" keys or a flat string containing only the series name. We should account for both cases to maximize compatibility. */?> Lecture Notes in Computer Science |
Subject (LOC): |
- Insights from the Conscious Turing Machine (CTM)
- Speculative Smart Contracts
- Optimization from Structured Samples-An Effective Approach for Data-Driven Optimization
- Recent Developments in Property Testing of Boolean Functions
- AC0 Circuits, First-Order Logic, and Well-Structured graphs
- Model-Based Digital Engineering and Verification of Intelligent Systems
- Tight Online Algorithms for Unrelated Machine Load Balancing with Predictions
- Fast Sampling Constraint Satisfaction Solutions via the Lovász Local Lemma
- Pool Block Withholding Attack with Rational Miners
- Approximation Algorithms for the Directed Path Partition Problems
- Faster Algorithms for k-Subset Sum and variations
- Hardness and Algorithms for Electoral Manipulation under Media Influence
- Improved Approximation Algorithms for Multiprocessor Scheduling with Testing.