Sciweavers

31387 search results - page 84 / 6278
» Abstracts
Sort
View
ENTCS
2007
102views more  ENTCS 2007»
15 years 2 months ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
14 years 9 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
ENTCS
2011
56views more  ENTCS 2011»
14 years 9 months ago
Feynman Graphs, and Nerve Theorem for Compact Symmetric Multicategories (Extended Abstract)
d abstract) Andr´e Joyal 1 D´epartement des math´ematiques Universit´e du Qu´ebec `a Montr´eal Canada Joachim Kock 2 3 Departament de matem`atiques Universitat Aut`onoma de B...
André Joyal, Joachim Kock
ICALP
2011
Springer
14 years 5 months ago
Liveness-Preserving Atomicity Abstraction
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
Alexey Gotsman, Hongseok Yang
CORR
2012
Springer
191views Education» more  CORR 2012»
13 years 10 months ago
The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)
erate (Extended Abstract) Patrick Bindjeme1† and James Allen Fill1 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Bal...
Patrick Bindjeme, James Allen Fill