Stem coin$ (all stems)

30 papers:

ICALP-v1-2015-FaonioNV

Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation (AF, JBN, DV), pp. 456–468.

ICALP-v2-2015-GoldwasserKP #adaptation #revisited

Adaptively Secure Coin-Flipping, Revisited (SG, YTK, SP), pp. 663–674.

STOC-2014-BermanHT #bias #constant

Coin flipping of any constant bias implies one-way functions (IB, IH, AT), pp. 398–407.

STOC-2014-HaitnerT #protocol

An almost-optimally fair three-party coin-flipping protocol (IH, ET), pp. 408–416.

ICALP-v1-2014-BravermanG #bound

Public vs Private Coin in Bounded-Round Information (MB, AG), pp. 502–513.

ICPR-2014-KimP #recognition

Ancient Coin Recognition Based on Spatial Coding (JK, VP), pp. 321–326.

ICPR-2014-ZambaniniKK #consistency #evaluation #geometry

Classifying Ancient Coins by Local Feature Matching and Pairwise Geometric Consistency Evaluation (SZ, AK, MK), pp. 3032–3037.

CIKM-2012-KurlandRS #clustering #predict #ranking

Query-performance prediction and cluster ranking: two sides of the same coin (OK, FR, AS), pp. 2459–2462.

LICS-2012-BienvenuM #revisited

Von Neumann’s Biased Coin Revisited (LB, BM), pp. 145–154.

ICALP-v1-2011-AaronsonD #quantum

Advice Coins for Classical and Quantum Computation (SA, AD), pp. 61–72.

HCI-DDA-2011-AlTaboliL #design #interface #metric #visual notation

Objective and Subjective Measures of Visual Aesthetics of Website Interface Design: The Two Sides of the Coin (AA, YL), pp. 35–44.

SIGIR-2011-DattaV #query

Tossing coins to trim long queries (SD, VV), pp. 1255–1256.

FM-2009-McIverMM #probability #security

Security, Probability and Nearly Fair Coins in the Cryptographers’ Café (AM, LM, CM), pp. 41–71.

KDD-2009-TsourakakisKMF #graph #named

DOULION: counting triangles in massive graphs with a coin (CET, UK, GLM, CF), pp. 837–846.

HCI-IPT-2007-AymanTT #interactive #interface

Coin Size Wireless Sensor Interface for Interaction with Remote Displays (AA, ST, JT), pp. 733–742.

ICEIS-EIS-2007-KukhunS #enterprise #information management #pervasive #security

Interoperability in Pervasive Enterprise Information Systems — A Double-Faced Coin Between Security And Accessability (DAK, FS), pp. 237–242.

ICPR-v3-2006-EmmsHW #graph #quantum #using

Graph Matching using Interference of Coined Quantum Walks (DE, ERH, RCW), pp. 133–136.

STOC-2001-Ambainis #bound #protocol #quantum

A new protocol and lower bounds for quantum coin flipping (AA), pp. 134–142.

ICALP-2001-Dodis #random

New Imperfect Random Source with Applications to Coin-Flipping (YD), pp. 297–309.

CIKM-2001-RosenthalW #data access #documentation #question

Document Release versus Data Access Controls: Two Sides of the Same Coin? (AR, GW), pp. 544–546.

MLDM-2001-Perner #classification #question #reasoning

Are Case-Based Reasoning and Dissimilarity-Based Classification Two Sides of the Same Coin? (PP), pp. 35–51.

STOC-1999-RussellSZ #bound

Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model (AR, MES, DZ), pp. 339–347.

STOC-1997-Aspnes #bound #distributed #random

Lower Bounds for Distributed Coin-Flipping and Randomized Consensus (JA), pp. 559–568.

STOC-1996-NewmanS #communication #game studies

Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract) (IN, MS), pp. 561–570.

STOC-1995-CuckerKKLW #on the #turing machine

On real Turing machines that toss coins (FC, MK, PK, TL, KW), pp. 335–342.

STOC-1993-BoppanaN #problem

The biased coin problem (RBB, BON), pp. 252–257.

ICALP-1989-FeldmanINNRS #generative #modelling #on the #random

On Dice and Coins: Models of Computation for Random Generation (DF, RI, MN, NN, SR, AS), pp. 319–340.

STOC-1986-Cleve #security

Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract) (RC), pp. 364–369.

STOC-1986-ColeV #algorithm #design #metaprogramming #parallel

Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms (RC, UV), pp. 206–219.

STOC-1986-GoldwasserS #interactive #proving

Private Coins versus Public Coins in Interactive Proof Systems (SG, MS), pp. 59–68.