Explore >> Select a destination

You are here

 blog.acolyer.org
Keeping CALM: when distributed consistency is easy | the morning paper
| | drops.dagstuhl.de
10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023)
22.8 parsecs away

Travel
| |
| | www.bailis.org
When Does Consistency Require Coordination? | Peter Bailis
12.7 parsecs away

Travel
| |
| | bloom-lang.net
calm: consistency as logical monotonicity | Bloom Programming Language
8.8 parsecs away

Travel
| | CALM: consistency as logical monotonicity One of the key innovations underlying Bloom is the ability to formally guarantee consistency properties of distributed programs. This reasoning is based o
| | mikespivey.wordpress.com
Some Corrections to My Paper "A Combinatorial View of Sums of Powers" | A Narrow Margin
80.8 parsecs away

Travel
| A few months ago Mathematics Magazine published a paper of mine, "A Combinatorial View of Sums of Powers." In it I give a combinatorial interpretation for the power sum $latex \sum_{k=1}^n k^m$, together with combinatorial proofs of two formulas for this power sum. (An earlier version of some of the results in this paper actually...