INSTRUCTIONS FOR APPENDIX A

Source URL: www.abcworld.org

• United States bankruptcy law
• Adversary proceeding in bankruptcy
• United States bankruptcy court
• Matter
• Bankruptcy

Online Algorithms Susanne Albers Stefano Leonardiy Over the past twelve years, online algorithms have received considerable research interest. Online

Source URL: www14.in.tum.de

• Online algorithms
• Analysis of algorithms
• Theoretical computer science
• Metrical task system
• K-server problem
• Adversary model
• Algorithm
• Competitive analysis
• Randomized algorithm
• Approximation algorithm
• Computational learning theory

Circular chosen-ciphertext security with compact ciphertexts Dennis Hofheinz∗ January 19, 2013 Abstract A key-dependent message (KDM) secure encryption scheme is secure even if an adversary

Source URL: www.kjdf.de

Exploitation as an Inference Problem David Cock NICTA and University of New South Wales ABSTRACT In this position paper, we suggest that an adversary seeking to exploit a side channel should be view

Source URL: research.davidcock.fastmail.fm

Adversary Gain vs. Defender Loss in Quantified Information Flow Piotr Mardziel,† Mário S. Alvim,‡ and Michael Hicks,† † University of Maryland, College Park ‡ Universidade Federal de Minas Gerais

Source URL: software.imdea.org

• Analysis of algorithms
• Online algorithms
• Adversary model

MACs and Authenticated Encryption February 7, 2013 Introduction Information Security consists of: – Confidentiality (achieved through encryption, aims to prevent adversary from reading a

Source URL: users.encs.concordia.ca

Optimal Projective Algorithms for the List Update Problem Christoph Amb¨uhl1 , Bernd G¨artner1 , and Bernhard von Stengel2 1 Institute for Theoretical Computer Science, ETH Z¨urich, 8092 Z¨urich, Switzerland.

Source URL: www.maths.lse.ac.uk

• Online algorithms
• Analysis of algorithms
• Computer science
• Mathematics
• Applied mathematics
• Competitive analysis
• List update problem
• Algorithm
• Permutation
• Adversary model
• Homography

Transiting Areas Patrolled by a Mobile Adversary Ondˇrej Vanˇek, Branislav Boˇsansk´y, Michal Jakob and Michal Pˇechouˇcek which it chooses a closed-walk starting and ending in a given location in the area, termed

Source URL: game.itu.dk

• Game theory
• Pursuit-evasion
• Strategy
• Nash equilibrium
• Search algorithm
• Flow network
• Directed graph
• Best response
• Algorithm

Theoretical Computer Science–16 www.elsevier.com/locate/tcs A new lower bound for the list update problem in the partial cost model

Source URL: www.maths.lse.ac.uk

• Online algorithms
• Analysis of algorithms
• List update problem
• Competitive analysis
• Adversary model
• Algorithm
• K-server problem

Byzantine Agreement with a Rational Adversary Adam Groce, Jonathan Katz? , Aishwarya Thiruvengadam, and Vassilis Zikas?? Department of Computer Science, University of Maryland {agroce,jkatz,aish,vzikas}@cs.umd.edu Abstr

Source URL: people.inf.ethz.ch