English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  The randomized complexity of maintaining the minimum

Brodal, G. S., Chaudhuri, S., & Radhakrishnan, R. (1996). The randomized complexity of maintaining the minimum. Nordic Journal of Computing, 3(4), 337-351.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ABAF-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ABB0-E
Genre: Journal Article

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Brodal, Gerth Stølting1, Author           
Chaudhuri, Shiva1, Author           
Radhakrishnan, R., Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021996
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 517827
Other: Local-ID: C1256428004B93B8-AB81020EEB028690C1256484004FB0BC-Brodal-Chaudhuri-Radhakrishnan
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Nordic Journal of Computing
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 3 (4) Sequence Number: - Start / End Page: 337 - 351 Identifier: ISSN: 1236-6064