Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

CONCUR 2003 - Concurrency Theory

From MaRDI portal
Publication:5900557
Jump to:navigation, search

DOI10.1007/b11938zbMath1274.68118OpenAlexW105220891MaRDI QIDQ5900557

Mihalis Yannakakis, Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha

Publication date: 30 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11938



Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)


Related Items (3)

A new algorithm for compression of partially commutative alphabets ⋮ A Theory of Formal Choreographic Languages ⋮ Realisability of pomsets




This page was built for publication: CONCUR 2003 - Concurrency Theory

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5900557&oldid=16940073"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 02:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki