Staff View
Two problems in noise tolerant computing

Descriptive

TitleInfo
Title
Two problems in noise tolerant computing
Name (type = personal)
NamePart (type = family)
Tang
NamePart (type = given)
Sijian
NamePart (type = date)
1991-
DisplayForm
Sijian Tang
Role
RoleTerm (authority = RULIB)
author
Name (type = personal)
NamePart (type = family)
Saks
NamePart (type = given)
Michael
DisplayForm
Michael Saks
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
chair
Name (type = personal)
NamePart (type = family)
Kopparty
NamePart (type = given)
Swastik
DisplayForm
Swastik Kopparty
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Allender
NamePart (type = given)
Eric
DisplayForm
Eric Allender
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Kindler
NamePart (type = given)
Guy
DisplayForm
Guy Kindler
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
outside member
Name (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB)
degree grantor
Name (type = corporate)
NamePart
School of Graduate Studies
Role
RoleTerm (authority = RULIB)
school
TypeOfResource
Text
Genre (authority = marcgt)
theses
OriginInfo
DateCreated (qualifier = exact)
2018
DateOther (qualifier = exact); (type = degree)
2018-10
CopyrightDate (encoding = w3cdtf)
2018
Place
PlaceTerm (type = code)
xx
Language
LanguageTerm (authority = ISO639-2b); (type = code)
eng
Abstract (type = abstract)
This thesis consists of 2 main results about computations under random noise. In both problems we consider the discrete input picked from the hamming cube {0,1}<sup>n</sup>. Noise is introduced by flipping each input bit randomly with some fixed probability.

In Chapter 2 we provide the first polynomial algorithm for noisy population recovery problem with finite support. This result directly implies a reverse Bonami-Beckner type inequality for sparse functions.

In Chapter 3 we study the noisy broadcast model and the generalized noisy decision tree (gnd-tree) model under noise cancellation adversary. Here noise cancellation adversary is a type of adversary that can correct the random noise. Under the noise cancellation adversary, we show an Ω(ε<sup>5</sup>·n log n) lower bound for the function $OR$ in the non-adaptive gnd-tree model. This implies an Ω(log(1/ε)<sup>-1</sup> ·n log log n) lower bound for a special kind of noisy broadcast model which we call the 2-Phase noisy broadcast model.
Subject (authority = RUETD)
Topic
Mathematics
Subject (authority = ETD-LCSH)
Topic
Random noise theory
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
RelatedItem (type = host)
TitleInfo
Title
School of Graduate Studies Electronic Theses and Dissertations
Identifier (type = local)
rucore10001600001
Identifier
ETD_9193
Identifier (type = doi)
doi:10.7282/t3-bhzn-nk34
PhysicalDescription
Form (authority = gmd)
electronic resource
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
1 online resource (77 pages: illustrations)
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references
Note (type = statement of responsibility)
by Sijian Tang
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Genre (authority = ExL-Esploro)
ETD doctoral
Back to the top

Rights

RightsDeclaration (ID = rulibRdec0006)
The author owns the copyright to this work.
RightsHolder (type = personal)
Name
FamilyName
Tang
GivenName
Sijian
Role
Copyright Holder
RightsEvent
Type
Permission or license
DateTime (encoding = w3cdtf); (qualifier = exact); (point = start)
2018-09-14 01:28:08
AssociatedEntity
Name
Sijian Tang
Role
Copyright holder
Affiliation
Rutgers University. School of Graduate Studies
AssociatedObject
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
ETD
OperatingSystem (VERSION = 5.1)
windows xp
CreatingApplication
Version
1.5
ApplicationName
MiKTeX pdfTeX-1.40.16
DateCreated (point = end); (encoding = w3cdtf); (qualifier = exact)
2018-09-26T22:58:30
DateCreated (point = end); (encoding = w3cdtf); (qualifier = exact)
2018-09-26T22:58:30
Back to the top
Version 8.5.5
Rutgers University Libraries - Copyright ©2024