Suchergebnisse - "((\"computing algorithms and informally\") OR (\"computing algorithms and informatik\"))*"

Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity.

Autoren: Balabán, Jakub Ganian, Robert Rocton, Mathis

Quelle: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 4, p2102-2141, 40p

Schlagwörter: GRAPH theory, GRAPH algorithms

The Computational Advantage of MIP* Vanishes in the Presence of Noise.

Autoren: Dong, Yangjing Fu, Honghao Natarajan, Anand et al.

Quelle: Journal of the ACM; Dec2025, Vol. 72 Issue 6, p1-78, 78p

Schlagwörter: NOISE, COMPUTATIONAL complexity, QUANTUM entanglement, QUANTUM computing, MATRIX functions

COMPUTING PATHS OF LARGE RANK IN PLANAR FRAMEWORKS DETERMINISTICALLY.

Autoren: FOMIN, FEDOR V. GOLOVACH, PETRA. KORHONEN, TUUKKA et al.

Quelle: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 1, p92-118, 27p

Schlagwörter: DETERMINISTIC algorithms, PLANAR graphs, UNDIRECTED graphs, PROBLEM solving, ALGORITHMS, MATROIDS

Optimized Noise Suppression for Quantum Circuits.

Autoren: Wagner, Friedrich Egger, Daniel J. Liers, Frauke

Quelle: INFORMS Journal on Computing; Jan/Feb2025, Vol. 37 Issue 1, p22-41, 20p

Schlagwörter: OPTIMIZATION algorithms, QUANTUM computing, DATA libraries, QUBITS, ROUTING algorithms, QUANTUM computers

Deterministic Minimum Cut in Poly-logarithmic Maximum Flows.

Autoren: Li, Jason Panigrahi, Debmalya

Quelle: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-18, 18p

Schlagwörter: UNDIRECTED graphs, GRAPH theory, DETERMINISTIC algorithms

Near-optimal distributed dominating set in bounded arboricity graphs.

Autoren: Dory, Michal Ghaffari, Mohsen Ilchi, Saeed

Quelle: Distributed Computing; Dec2024, Vol. 37 Issue 4, p387-398, 12p

Schlagwörter: DISTRIBUTED algorithms, DOMINATING set, DISTRIBUTED computing, ALGORITHMS, CONFERENCES & conventions

On the dissertation "Scalable SAT Solving and its Application".

Autoren: Schreiber, Dominik

Quelle: IT: Information Technology; Feb2025, Vol. 67 Issue 1, p46-53, 8p

Schlagwörter: ACADEMIC dissertations, DISTRIBUTED algorithms, AUTOMATED planning & scheduling, CLOUD computing, COMPUTER science

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.

Autoren: Bhattacharya, Sayan Kiss, Peter Saranurak, Thatchaphol et al.

Quelle: Journal of the ACM; Oct2024, Vol. 71 Issue 5, p1-32, 32p

Schlagwörter: GRAPH algorithms, OPEN-ended questions, ALGORITHMS

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time.

Autoren: Chen, Li Kyng, Rasmus Liu, Yang et al.

Quelle: Journal of the ACM; Jun2025, Vol. 72 Issue 3, p1-103, 103p

Schlagwörter: DIRECTED acyclic graphs, DATA structures, INTERIOR-point methods, ISOTONIC regression, FLOWGRAPHS

Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.

Autoren: Limaye, Nutan Srinivasan, Srikanth Tavenas, Sébastien

Quelle: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-35, 35p

Schlagwörter: COMPUTATIONAL complexity, CIRCUIT complexity, POLYNOMIALS, COMPUTER circuits, MATHEMATICAL bounds

RAFDivider: a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks.

Autoren: Doutre, Sylvie Lagasquie-Schiex, Marie-Christine

Quelle: Journal of Applied Non-Classical Logics; 2023, Vol. 33 Issue 3/4, p244-297, 54p

Schlagwörter: DISTRIBUTED algorithms, DISTRIBUTED computing, SEMANTICS, MANURES, OPEN-ended questions

Early adapting to trends: self-stabilizing information spread using passive communication.

Autoren: Korman, Amos Vacus, Robin

Quelle: Distributed Computing; Dec2024, Vol. 37 Issue 4, p335-362, 28p

Schlagwörter: DISTRIBUTED computing, COMMUNICATION models, INFORMATION storage & retrieval systems, PROBLEM solving, ALGORITHMS

Asymmetric distributed trust.

Autoren: Alpos, Orestis Cachin, Christian Tackmann, Björn et al.

Quelle: Distributed Computing; Sep2024, Vol. 37 Issue 3, p247-277, 31p

Schlagwörter: DISTRIBUTED computing, ALGORITHMS, MEMORY, BROADCASTING industry

The canonical amoebot model: algorithms and concurrency control.

Autoren: Daymude, Joshua J. Richa, Andréa W. Scheideler, Christian

Quelle: Distributed Computing; Jun2023, Vol. 36 Issue 2, p159-192, 34p

Schlagwörter: ALGORITHMS, SEQUENTIAL analysis, DISTRIBUTED computing, MESSAGE passing (Computer science)

Log-Diameter MST Verification and Sensitivity in MPC.

Autoren: Coy, Sam Czumaj, Artur Mishra, Gopinath et al.

Quelle: Algorithmica; Dec2025, Vol. 87 Issue 12, p1899-1932, 34p

Schlagwörter: SENSITIVITY analysis, SPANNING trees, OPTIMIZATION algorithms, GRAPH theory, PARALLEL programming

Boosting Double Coverage for k-Server via Imperfect Predictions.

Autoren: Lindermayr, Alexander Megow, Nicole Simon, Bertrand

Quelle: Algorithmica; Nov2025, Vol. 87 Issue 11, p1477-1517, 41p

Schlagwörter: ONLINE algorithms, ALGORITHMS, EMPIRICAL research, FORECASTING

On the Need for Large Quantum Depth.

Autoren: NAI-HUI CHIA KAI-MIN CHUNG CHING-YI LAI

Quelle: Journal of the ACM; Feb2023, Vol. 70 Issue 1, p1-38, 38p

Schlagwörter: QUANTUM computing, QUANTUM computers, CIRCUIT complexity, FOURIER transforms, LOGICAL prediction, HYBRID computers (Computer architecture)

Sparse Higher Order Čech Filtrations.

Autoren: Buchet, Mickaël B Dornelas, Bianca Kerber, Michael

Quelle: Journal of the ACM; Aug2024, Vol. 71 Issue 4, p1-23, 23p

Schlagwörter: SEQUENCE spaces, DATA analysis, TOPOLOGY, ALGORITHMS

Flow-augmentation I: Directed graphs.

Autoren: Kim, Eun Jung Kratsch, Stefan Pilipczuk, Marcin et al.

Quelle: Journal of the ACM; Feb2025, Vol. 72 Issue 1, p1-38, 38p

Schlagwörter: POLYNOMIAL time algorithms, GRAPH algorithms, CUTTING stock problem, INTEGERS, LOGICAL prediction, DIRECTED graphs

Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead.

Autoren: Ron-Zewi, Noga Rothblum, Ron

Quelle: Journal of the ACM; Apr2025, Vol. 72 Issue 2, p1-54, 54p

Schlagwörter: LOGIC circuits, CIRCUIT complexity, FINITE fields, MULTIPLICATION, ARITHMETIC