Tight Bounds on Oblivious Chaining

Chaudhuri, Shiva

doi:10.1137/S0097539792230277

Local TagsRelease HistoryDetailsSummary

Tight Bounds on Oblivious Chaining

Chaudhuri, S. (1994). Tight Bounds on Oblivious Chaining. SIAM Journal on Computing, 23(6), 1253-1265. doi:10.1137/S0097539792230277.

Item is Released

show all

Basic

hide

Item Permalink: https://hdl.handle.net/21.11116/0000-000E-4B01-D Version Permalink: https://hdl.handle.net/21.11116/0000-000E-4B02-C

Genre: Journal Article

Files

show Files

Locators

show

Creators

hide

Creators:
Chaudhuri, Shiva¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

hide

Language(s): eng - English

Dates: Date issued: 1994

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1137/S0097539792230277
BibTex Citekey: Chaudhuri_SIAM.J.Comput.94

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

hide

Title: SIAM Journal on Computing

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Philadelphia, PA : SIAM

Pages: - Volume / Issue: 23 (6) Sequence Number: - Start / End Page: 1253 - 1265 Identifier: ISSN: 0097-5397
CoNE: https://pure.mpg.de/cone/journals/resource/954925466249