Ben Morris - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2025

Resound: A Moment of Reflection in a Techno-Spiritual RtD InquiryCaroline Claisse, David J. Chatting, Sara Wolf, Ben Morris, Abigail C. Durrant. tei 2025: [doi]

2018

How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function?Shoni Gilboa, Shay Gueron, Ben Morris. joc, 31(1):162-171, 2018. [doi]

Communicative pressure can lead to input that supports language learningBen Morris, Daniel Yurovsky. cogsci 2018: [doi]

Deterministic Encryption with the Thorp ShuffleBen Morris, Phillip Rogaway, Till Stegers. joc, 31(2):521-536, 2018. [doi]

2014

Sometimes-Recurse Shuffle - Almost-Random Permutations in Logarithmic Expected TimeBen Morris, Phillip Rogaway. eurocrypt 2014: 311-326 [doi]

2013

Sometimes-Recurse Shuffle: Almost-Random Permutations in Logarithmic Expected TimeBen Morris, Phillip Rogaway. iacr, 2013:560, 2013. [doi]

Improved Mixing Time Bounds for the Thorp ShuffleBen Morris. cpc, 22(1):118-132, 2013. [doi]

2012

An Enciphering Scheme Based on a Card ShuffleViet Tung Hoang, Ben Morris, Phillip Rogaway. crypto 2012: 1-13 [doi]

2009

How to Encipher Messages on a Small DomainBen Morris, Phillip Rogaway, Till Stegers. crypto 2009: 286-302 [doi]

2008

The Mixing Time of the Thorp ShuffleBen Morris. SICOMP, 38(2):484-504, 2008. [doi]

2005

The mixing time of the Thorp shuffleBen Morris. stoc 2005: 403-412 [doi]

2004

Random Walks on Truncated Cubes and Sampling 0-1 Knapsack SolutionsBen Morris, Alistair Sinclair. SICOMP, 34(1):195-226, 2004. [doi]

2003

Evolving sets and mixinBen Morris, Yuval Peres. stoc 2003: 279-286 [doi]

1999

Improved Bounds for Sampling Contingency TablesBen Morris. random 1999: 121-129

Random Walks on Truncated Cubes and Sampling 0-1 Knapsack SolutionsBen Morris, Alistair Sinclair. focs 1999: 230-240 [doi]

Sign in or sign up to see more results.

runs on WebDSL