### 9 papers:

- STOC-2012-BhaskaraDKT #linear #query
- Unconditional differentially private mechanisms for linear queries (AB, DD, RK, KT), pp. 1269–1284.
- STOC-2011-Yoshida #algorithm #approximate #bound #csp
- Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP (YY), pp. 665–674.
- KR-2010-SanthanamBH #performance #testing
- Efficient Dominance Testing for Unconditional Preferences (GRS, SB, VH).
- ICALP-v1-2009-BuhrmanFS #bound
- Unconditional Lower Bounds against Advice (HB, LF, RS), pp. 195–209.
- STOC-2008-Lovett #generative #pseudo
- Unconditional pseudorandom generators for low degree polynomials (SL), pp. 557–562.
- STOC-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.
- DLT-1997-FernauS #how
- How Powerful is Unconditional Transfer? — When UT meets AC (HF, FS), pp. 249–260.
- PLDI-1992-MuellerW #replication
- Avoiding Unconditional Jumps by Code Replication (FM, DBW), pp. 322–330.
- STOC-1988-ChaumCD #multi #protocol
- Multiparty Unconditionally Secure Protocols (Extended Abstract) (DC, CC, ID), pp. 11–19.