Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Reproducibility and Pseudo-Determinism in Log-Space

From MaRDI portal
Publication:5236219
Jump to:navigation, search

DOI10.1137/1.9781611975482.38zbMath1431.68138arXiv1803.04025OpenAlexW2793253595MaRDI QIDQ5236219

No author found.

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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



Mathematics Subject Classification ID

Randomized algorithms (68W20)


Related Items (2)

On Pseudodeterministic Approximation Algorithms. ⋮ Planar Maximum Matching: Towards a Parallel Algorithm




This page was built for publication: Reproducibility and Pseudo-Determinism in Log-Space

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5236219&oldid=19856599"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 19:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki