output
20022017
most citedLeftover Hashing Against Quantum Side Information

313 citations

Showing 2012Show all

22 papers · 1 filter

cs.PL20126 cited

Interacting via the Heap in the Presence of Recursion

Jurriaan Rot, Irina Măriuca Asăvoae, Frank de Boer +2

Almost all modern imperative programming languages include operations for dynamically manipulating the heap, for example by allocating and deallocating objects, and by updating ref…

cs.FL20121 cited

Combining Insertion and Deletion in RNA-editing Preserves Regularity

E. P. de Vink, H. Zantema, D. Bošnački

Inspired by RNA-editing as occurs in transcriptional processes in the living cell, we introduce an abstract notion of string adjustment, called guided rewriting. This formalism all…

cs.GT20121 cited

Social Network Games

Sunil Simon, Krzysztof R. Apt

One of the natural objectives of the field of the social networks is to predict agents' behaviour. To better understand the spread of various products through a social network arXi…

math.CO2012

Positivity for Gaussian graphical models

Jan Draisma, Seth Sullivant, Kelli Talaska

Gaussian graphical models are parametric statistical models for jointly normal random variables whose dependence structure is determined by a graph. In previous work, we introduced…

cs.LO20124 cited

Bisimulation of Labeled State-to-Function Transition Systems of Stochastic Process Languages

D. Latella, M. Massink, E. P. de Vink

Labeled state-to-function transition systems, FuTS for short, admit multiple transition schemes from states to functions of finite support over general semirings. As such they cons…

cs.PL201210 cited

A Procedure for Splitting Processes and its Application to Coordination

Sung-Shik T. Q. Jongmans, Dave Clarke, José Proença

We present a procedure for splitting processes in a process algebra with multi-actions (a subset of the specification language mCRL2). This splitting procedure cuts a process into…