Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The DAG visit approach for pebbling and I/O lower bounds - MaRDI portal

The DAG visit approach for pebbling and I/O lower bounds

From MaRDI portal

Publication:6604608

Jump to:navigation, search

DOI10.4230/LIPICS.FSTTCS.2022.7MaRDI QIDQ6604608

Gianfranco Bilardi, Lorenzo De Stefani

Publication date: 12 September 2024

zbMATH Keywords

directed acyclic graph pebbling pebbling number I/O complexity

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

This page was built for publication: The DAG visit approach for pebbling and I/O lower bounds

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6604608&oldid=40155696"