Stem oblivi$ (all stems)

54 papers:

ICALP-v1-2015-BeameLP #bound

Finding the Median (Obliviously) with Bounded Space (PB, VL, MP), pp. 103–115.

ECOOP-2015-HaqueP #type inference

Type Inference for Place-Oblivious Objects (RH, JP), pp. 371–395.

SAC-2015-Kerschbaum #generative #outsourcing

Oblivious outsourcing of garbled circuit generation (FK), pp. 2134–2140.

ASPLOS-2015-FletcherRKDD #ram #recursion #verification

Freecursive ORAM: [Nearly] Free Recursion and Integrity Verification for Position-based Oblivious RAM (CWF, LR, AK, MvD, SD), pp. 103–116.

ASPLOS-2015-LiuHMHTS #memory management #named

GhostRider: A Hardware-Software System for Memory Trace Oblivious Computation (CL, AH, MM, MWH, MT, ES), pp. 87–101.

PPoPP-2015-TangYKTGC #algorithm #parallel #programming #recursion

Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency (YT, RY, HK, JJT, PG, RAC), pp. 205–214.

PODS-2014-BenderFFFG

Cost-oblivious storage reallocation (MAB, MFC, SPF, JTF, SG), pp. 278–288.

STOC-2014-Goodrich #algorithm #sorting

Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time (MTG), pp. 684–693.

ICALP-v1-2014-NelsonN #bound

Lower Bounds for Oblivious Subspace Embeddings (JN, HLN), pp. 883–894.

ICALP-v2-2014-OhrimenkoGTU #in the cloud

The Melbourne Shuffle: Improving Oblivious Storage in the Cloud (OO, MTG, RT, EU), pp. 556–567.

SAC-2014-GuimaraesGF #composition #on the #quantifier

On the impact of obliviousness and quantification on model composition effort (EG, AG, KF), pp. 1043–1048.

ASPLOS-2014-KwonKP #multi

Locality-oblivious cache organization leveraging single-cycle multi-hop NoCs (WCK, TK, LSP), pp. 715–728.

HPCA-2014-FletcherRYDKD #information management #performance #ram #trade-off

Suppressing the Oblivious RAM timing channel while making information leakage and program efficiency trade-offs (CWF, LR, XY, MvD, OK, SD), pp. 213–224.

HPCA-2014-KimLJK #architecture #gpu #memory management #named #using

GPUdmm: A high-performance and memory-oblivious GPU architecture using dynamic memory management (YK, JL, JEJ, JK), pp. 546–557.

VLDB-2013-HeimelSPMM #in memory #parallel

Hardware-Oblivious Parallelism for In-Memory Column-Stores (MH, MS, HP, SM, VM), pp. 709–720.

ICML-c1-2013-ChenC13a

Noisy and Missing Data Regression: Distribution-Oblivious Support Recovery (YC, CC), pp. 383–391.

LATA-2012-BilleS #dependence #performance #programming

Fast and Cache-Oblivious Dynamic Programming with Local Dependencies (PB, MS), pp. 131–142.

OOPSLA-2012-HuangZ12a #concurrent #execution #source code

Execution privatization for scheduler-oblivious concurrent programs (JH, CZ), pp. 737–752.

ICALP-v2-2011-GoodrichM #outsourcing #privacy #ram #simulation

Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation (MTG, MM), pp. 576–587.

PODS-2010-PaghWYZ

Cache-oblivious hashing (RP, ZW, KY, QZ), pp. 297–304.

SIGMOD-2010-SatishKCNLKD #performance

Fast sort on CPUs and GPUs: a case for bandwidth oblivious SIMD sort (NS, CK, JC, ADN, VWL, DK, PD), pp. 351–362.

STOC-2010-Ajtai

Oblivious RAMs without cryptogrpahic assumptions (MA), pp. 181–190.

ICALP-v1-2010-ColeR #multi #sorting

Resource Oblivious Sorting on Multicores (RC, VR), pp. 226–237.

ASPLOS-2010-KirmanM #power management #using

A power-efficient all-optical on-chip interconnect using wavelength-based oblivious routing (NK, JFM), pp. 15–28.

STOC-2009-DaskalakisP #equilibrium #nash #on the

On oblivious PTAS’s for nash equilibrium (CD, CHP), pp. 75–84.

STOC-2009-GoldreichR #on the #proximity #testing

On proximity oblivious testing (OG, DR), pp. 141–150.

ICALP-v2-2009-ScheidelerS #distributed

A Distributed and Oblivious Heap (CS, SS), pp. 571–582.

SAC-2009-RobertsSG #interface

Model interfaces for two-way obliviousness (NVR, ES, PCG), pp. 488–495.

PODS-2008-FerraginaGGSV #on the #string

On searching compressed string collections cache-obliviously (PF, RG, AG, RS, JSV), pp. 181–190.

ICALP-C-2008-PrzydatekW

Error-Tolerant Combiners for Oblivious Primitives (BP, JW), pp. 461–472.

ICSE-2008-HoffmanE #aspect-oriented #component #composition #empirical #reuse #towards

Towards reusable components with aspects: an empirical study on modularity and obliviousness (KJH, PE), pp. 91–100.

SIGMOD-2007-HeLLY #in memory #named #query

EaseDB: a cache-oblivious in-memory query processor (BH, YL, QL, DY), pp. 1064–1066.

PODS-2006-BenderFK #string

Cache-oblivious string B-trees (MAB, MFC, BCK), pp. 233–242.

CIKM-2006-HeL

Cache-oblivious nested-loop joins (BH, QL), pp. 718–727.

STOC-2005-HajiaghayiKLR #graph #random

Oblivious routing in directed graphs with random demands (MTH, JHK, TL, HR), pp. 193–201.

ICALP-2005-BrodalFM #adaptation #sorting

Cache-Aware and Cache-Oblivious Adaptive Sorting (GSB, RF, GM), pp. 576–588.

ICALP-2005-JampalaZ

Cache-Oblivious Planar Shortest Paths (HJ, NZ), pp. 563–575.

OSDI-2004-RinardCDRLB #security

Enhancing Server Availability and Security Through Failure-Oblivious Computing (MCR, CC, DD, DMR, TL, WSB), pp. 303–316.

STOC-2003-AzarCFKR #polynomial

Optimal oblivious routing in polynomial time (YA, EC, AF, HK, HR), pp. 383–388.

STOC-2003-BrodalF #on the

On the limits of cache-obliviousness (GSB, RF), pp. 307–315.

ICALP-2003-FranceschiniG

Optimal Cache-Oblivious Implicit Dictionaries (GF, RG), pp. 316–331.

STOC-2002-ArgeBDHM #algorithm #graph #queue

Cache-oblivious priority queue and graph algorithm applications (LA, MAB, EDD, BHM, JIM), pp. 268–276.

ICALP-2002-BenderCR #algorithm #exponential #performance

Exponential Structures for Efficient Cache-Oblivious Algorithms (MAB, RC, RR), pp. 195–207.

ICALP-2002-BrodalF

Cache Oblivious Distribution Sweeping (GSB, RF), pp. 426–438.

STOC-1999-NaorP #evaluation #polynomial

Oblivious Transfer and Polynomial Evaluation (MN, BP), pp. 245–254.

STOC-1997-Micciancio #data type #encryption

Oblivious Data Structures: Applications to Cryptography (DM), pp. 456–464.

ICALP-1996-AumannB #performance

Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler (YA, MAB), pp. 622–633.

STOC-1990-Ostrovsky #performance

Efficient Computation on Oblivious RAMs (RO), pp. 514–523.

STOC-1988-FiatNSS

Non-Oblivious Hashing (Extended Abstract) (AF, MN, JPS, AS), pp. 367–376.

STOC-1988-Kilian #encryption

Founding Cryptography on Oblivious Transfer (JK), pp. 20–31.

STOC-1988-KrizancPU #trade-off

A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract) (DK, DP, EU), pp. 93–102.

STOC-1987-Goldreich #formal method #simulation #towards

Towards a Theory of Software Protection and Simulation by Oblivious RAMs (OG), pp. 182–194.

STOC-1982-Vitanyi #multi #realtime #simulation #turing machine

Real-Time Simulation of Multicounters by Oblivious One-Tape Turing Machines (PMBV), pp. 27–36.

ICALP-1979-SavageS #integer #multi #trade-off

Space-Time Tradeoffs for Oblivious Integer Multiplications (JES, SS), pp. 498–504.