scientific article; zbMATH DE number 7788374

DOI10.5555/3458064.3458100MaRDI QIDQ6147285zbMATH OpenFDO

Authors Noam Nisan

Publication date 15 January 2024

Full work available at URL https://arxiv.org/abs/1906.04213

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Rounds vs. communication tradeoffs for maximal independent sets
• On the communication complexity of finding a king in a tournament
• Learning-augmented query policies for minimum spanning tree with uncertainty
• Non-adaptive edge counting and sampling via bipartite independent set queries
• Logarithmic comparison-based query complexity for fair division of indivisible goods

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147285)