FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On the convergence of Newton's method for monotone systems of polynomial equations
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Automata, Probability, and Recursion
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
Discounted Properties of Probabilistic Pushdown Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Methods for Quantitative Analysis of Probabilistic Pushdown Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
PReMo: an analyzer for probabilistic recursive models
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
An extension of Newton's method to ω-continuous semirings
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Journal of the ACM (JACM)
Space-efficient scheduling of stochastically generated tasks
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Computing the Least Fixed Point of Positive Polynomial Systems
SIAM Journal on Computing
On probabilistic parallel programs with process creation and synchronisation
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Runtime analysis of probabilistic programs with unbounded recursion
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Efficient analysis of probabilistic programs with an unbounded counter
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Space-efficient scheduling of stochastically generated tasks
Information and Computation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Computing the expected accumulated reward and gain for a subclass of infinite markov chains
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Analysis of recursive probabilistic models
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Stanford: probabilistic edit distance metrics for STS
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
Probabilistic finite state machines for regression-based MT evaluation
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
SPEDE: probabilistic edit distance metrics for MT evaluation
WMT '12 Proceedings of the Seventh Workshop on Statistical Machine Translation
Branching-time model-checking of probabilistic pushdown automata
Journal of Computer and System Sciences
Analyzing probabilistic pushdown automata
Formal Methods in System Design
Hi-index | 0.00 |
The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated ...