default search action
Antoni W. Mazurkiewicz
Person information
- affiliation: Institute of Computer Science, Polish Academy of Sciences, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j15]Wojciech Jamroga
, Wojciech Penczek
Towards Partial Order Reductions for Strategic Ability. J. Artif. Intell. Res. 68: 817-850 (2020)
2010 – 2019
- 2018
- [c18]Wojciech Jamroga, Wojciech Penczek
Towards Partial Order Reductions for Strategic Ability. AAMAS 2018: 156-165 - 2012
- [j14]Antoni W. Mazurkiewicz:
Petri net languages revisited. Theor. Comput. Sci. 429: 227-235 (2012) - 2010
- [j13]Antoni W. Mazurkiewicz:
Local Computations on Triangular Graphs. Fundam. Informaticae 100(1-4): 117-140 (2010)
2000 – 2009
- 2008
- [c17]Antoni W. Mazurkiewicz:
Token-Free Petri Nets. Pillars of Computer Science 2008: 506-520 - [c16]Jérémie Chalopin, Antoni W. Mazurkiewicz, Yves Métivier:
Labelled (Hyper)Graphs, Negotiations and the Naming Problem. ICGT 2008: 54-68 - 2007
- [j12]Antoni W. Mazurkiewicz:
Romanian Academy Calea Victoriei 125, Bucharest, Romania Locally Derivable Graphs. Fundam. Informaticae 75(1-4): 335-355 (2007) - [j11]Antoni W. Mazurkiewicz:
Compositional Systems over Reducible Networks. Fundam. Informaticae 79(3-4): 265-282 (2007) - [j10]Antoni W. Mazurkiewicz:
Local Properties of Triangular Graphs. Fundam. Informaticae 79(3-4): 487-495 (2007) - [c15]Antoni W. Mazurkiewicz:
Petri Nets Without Tokens. ICATPN 2007: 20-23 - 2004
- [j9]Antoni W. Mazurkiewicz:
Bilateral Ranking Negotiations. Fundam. Informaticae 60(1-4): 1-16 (2004) - [j8]Antoni W. Mazurkiewicz:
Multilateral Ranking Negotiations. Fundam. Informaticae 63(2-3): 241-258 (2004) - 2003
- [c14]Antoni W. Mazurkiewicz:
Competition, Cooperation, and Authorization. ESAW 2003: 155-167 - 2001
- [c13]Antoni W. Mazurkiewicz, Dobieslaw Wróblewski:
Messages, Clocks, and Gravitation. CEEMAS 2001: 187-196
1990 – 1999
- 1997
- [j7]Antoni W. Mazurkiewicz:
Distributed Enumeration. Inf. Process. Lett. 61(5): 233-239 (1997) - [c12]Antoni W. Mazurkiewicz:
Locally Computable Enumerations. FCT 1997: 51-66 - [e2]Antoni W. Mazurkiewicz, Józef Winkowski:
CONCUR '97: Concurrency Theory, 8th International Conference, Warsaw, Poland, July 1-4, 1997, Proceedings. Lecture Notes in Computer Science 1243, Springer 1997, ISBN 3-540-63141-0 [contents] - 1996
- [c11]Antoni W. Mazurkiewicz:
Prefix function view of states and events. Partial Order Methods in Verification 1996: 1-23 - 1995
- [c10]Antoni W. Mazurkiewicz:
True versus artificial concurrency. PSTV 1995: 53-68 - [p1]Antoni W. Mazurkiewicz:
Introduction to Trace Theory. The Book of Traces 1995: 3-41 - 1993
- [j6]Antoni W. Mazurkiewicz:
Distributed Disassembly of Mosaics. Inf. Process. Lett. 46(4): 173-178 (1993) - 1991
- [j5]Antoni W. Mazurkiewicz, Alexander Moshe Rabinovich
Connectedness and Synchronization. Theor. Comput. Sci. 90(1): 171-184 (1991)
1980 – 1989
- 1989
- [j4]Antoni W. Mazurkiewicz, Edward Ochmanski, Wojciech Penczek
Concurrent Systems and Inevitability. Theor. Comput. Sci. 64(3): 281-304 (1989) - [c9]Antoni W. Mazurkiewicz:
Concurrency, Modularity, and Synchronization. MFCS 1989: 577-598 - 1988
- [j3]Antoni W. Mazurkiewicz:
Solvability of the Asynchronous Ranking Problem. Inf. Process. Lett. 28(5): 221-224 (1988) - [c8]Antoni W. Mazurkiewicz:
Basic notions of trace theory. REX Workshop 1988: 285-363 - 1987
- [c7]Violetta Koseska-Toszewa, Antoni W. Mazurkiewicz:
Net Representation of Sentences in Natural Languages. European Workshop on Applications and Theory of Petri Nets 1987: 249-265 - [c6]Antoni W. Mazurkiewicz:
Compositional Semantics of Pure Place/ Transition Systems. European Workshop on Applications and Theory of Petri Nets 1987: 307-330 - 1986
- [c5]Antoni W. Mazurkiewicz:
Trace Theory. Advances in Petri Nets 1986: 279-324 - 1984
- [c4]Antoni W. Mazurkiewicz:
Semantics of concurrent systems: a modular fixed-point trace approach. European Workshop on Applications and Theory in Petri Nets 1984: 353-375 - [c3]Antoni W. Mazurkiewicz:
Traces, Histories, Graphs: Instances of a Process Monoid. MFCS 1984: 115-133
1970 – 1979
- 1979
- [c2]Antoni W. Mazurkiewicz:
Concurrent algorithms schemata. Algorithms in Modern Mathematics and Computer Science 1979: 460-461 - 1976
- [e1]Antoni W. Mazurkiewicz:
Mathematical Foundations of Computer Science 1976, 5th Symposium, Gdansk, Poland, September 6-10, 1976, Proceedings. Lecture Notes in Computer Science 45, Springer 1976, ISBN 0-387-07854-1 [contents] - 1975
- [c1]Antoni W. Mazurkiewicz:
Parallel Recursive Program Schemes. MFCS 1975: 75-87 - 1971
- [j2]Antoni W. Mazurkiewicz:
Proving Algorithms by Tail Functions. Inf. Control. 18(3): 220-226 (1971)
1960 – 1969
- 1969
- [j1]Antoni W. Mazurkiewicz:
A Note on Enumerable Grammars. Inf. Control. 14(6): 555-558 (1969)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: