Back to Results
First PageMeta Content
Group theory / Functions and mappings / Lemmas / Linear algebra / Category theory / Monoid / Function / Coset / Pumping lemma for context-free languages / Mathematics / Algebra / Abstract algebra


Stably Computable Predicates are Semilinear Dana Angluin James Aspnes Department of Computer
Add to Reading List

Document Date: 2015-02-03 22:51:46

Open Document

File Size: 157,50 KB

Share Result on Facebook

City

Denver / Marina del Rey / /

Company

Z2 / Krieger Publishing Company / Distributed Systems / ACM Press / /

Country

United States / /

Currency

USD / /

/

IndustryTerm

vector addition systems / machinery / dot product / population protocol / computing / population protocols / communication networks / /

Organization

Yale University Department of Computer Science / London Mathematical Society / National Science Foundation / David Eisenstat Department of Computer Science / University of Rochester / Yale University / Semilinear Dana Angluin James Aspnes Department of Computer Science / /

Person

Serge Lang / Matt Welsh / James Aspnes / Paul Spirakis / Eric Ruppert / Oscar H. Ibarra / Zhe Dang / Hong Jiang / David Eisenstat / Dana Angluin / Omer Egecioglu / Michael J. Fischer / Sitharama Iyengar / Melody Chan / Dana Angluin James Aspnes / /

Position

Parallelism and concurrency General / /

ProvinceOrState

Colorado / /

PublishedMedium

Theoretical Computer Science / Lecture Notes in Computer Science / /

Technology

population protocol / population protocols / Terms Theory Keywords Population protocols / 1.1 Population protocols / /

SocialTag