BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
bound (3)
degre (2)
approxim (2)
time (2)
lower (2)

Stem uncondit$ (all stems)

9 papers:

STOCSTOC-2012-BhaskaraDKT #linear #query
Unconditional differentially private mechanisms for linear queries (AB, DD, RK, KT), pp. 1269–1284.
STOCSTOC-2011-Yoshida #algorithm #approximate #bound #csp
Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP (YY), pp. 665–674.
KRKR-2010-SanthanamBH #performance #testing
Efficient Dominance Testing for Unconditional Preferences (GRS, SB, VH).
ICALPICALP-v1-2009-BuhrmanFS #bound
Unconditional Lower Bounds against Advice (HB, LF, RS), pp. 195–209.
STOCSTOC-2008-Lovett #generative #pseudo
Unconditional pseudorandom generators for low degree polynomials (SL), pp. 557–562.
STOCSTOC-2004-Elkin #approximate #bound #distributed #problem #trade-off
Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (ME), pp. 331–340.
DLTDLT-1997-FernauS #how
How Powerful is Unconditional Transfer? — When UT meets AC (HF, FS), pp. 249–260.
PLDIPLDI-1992-MuellerW #replication
Avoiding Unconditional Jumps by Code Replication (FM, DBW), pp. 322–330.
STOCSTOC-1988-ChaumCD #multi #protocol
Multiparty Unconditionally Secure Protocols (Extended Abstract) (DC, CC, ID), pp. 11–19.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.