Work

A Nearly Optimal Randomized Algorithm for Explorable Heap Selection

Year: 2023

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/978-3-031-32726-1_3

Authors: Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev

Institutions: Centrum Wiskunde & Informatica, Columbia University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: European Commission

OpenAlex ID: W4377199994

FWCI: 1.248

Cites: 15

Cited by: 4

Related to: 10