Structural Information and Communication Complexity

DOI10.1007/b136628zbMath1085.68534OpenAlexW2480963397MaRDI QIDQ5710093

Roberto De Prisco, Paolo Penna, Giuseppe Persiano, Vincenzo Auletta

Publication date: 30 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136628

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (3)

Truthful algorithms for scheduling selfish tasks on parallel machines ⋮ A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints ⋮ Fast payment schemes for truthful mechanisms with verification

This page was built for publication: Structural Information and Communication Complexity