Anca Muscholl - Citegraph

Author Info

Name	Affiliation	Papers
ANCA MUSCHOLL	LIAFA, Université Paris VII, 2, place Jussieu, case 7014, 75251 Paris cedex 05, France	80
Collaborators	Citations	PageRank
75	1179	74.92
Referers	Referees	References
1103	627	960

Search Limit

1001000

Publications (80 rows)

Collaborators (75 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Pumping Lemmas For Weighted Automata	0	0.34	2021
Minimization of visibly pushdown automata is NP-complete	0	0.34	2020
Equivalence of finite-valued streaming string transducers is decidable.	0	0.34	2019
On Synthesis of Resynchronizers for Transducers.	0	0.34	2019
One-way definability of two-way word transducers.	0	0.34	2018
On Canonical Models for Rational Functions over Infinite Words.	0	0.34	2018
Origin-equivalence of two-way word transducers is in PSPACE.	0	0.34	2018
Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211).	0	0.34	2018
A Tour of Recent Results on Word Transducers.	0	0.34	2017
Automated Synthesis: a Distributed Viewpoint.	0	0.34	2017
Soundness in Negotiations.	0	0.34	2017
On the Decomposition of Finite-Valued Streaming String Transducers.	0	0.34	2017
ICALP 2017 - Call for Papers.	0	0.34	2016
Automated Synthesis: Going Distributed	0	0.34	2016
Preface of STACS 2013 Special Issue	0	0.34	2016
On parametrized verification of asynchronous, shared-memory pushdown systems.	0	0.34	2016
Minimizing Resources of Sweeping and Streaming String Transducers.	1	0.35	2016
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable.	6	0.46	2015
One-way Definability of Sweeping Transducer.	2	0.36	2015
A Note on Monitors and Büchi automata.	3	0.39	2015
Automated Synthesis of Distributed Controllers	4	0.44	2015
On Distributed Monitoring and Synthesis	0	0.34	2015
Distributed Synthesis for Acyclic Architectures.	6	0.46	2014
A quadratic construction for Zielonka automata with acyclic communication structure.	3	0.39	2013
Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge.	1	0.37	2013
Walking on Data Words.	3	0.39	2013
Asynchronous games over tree architectures	11	0.58	2013
Recursive queries on trees and data trees	4	0.43	2013
Reachability Analysis of Communicating Pushdown Systems	26	0.88	2012
On Injective Embeddings of Tree Patterns	1	0.39	2012
On distributed monitoring of asynchronous systems	1	0.37	2012
Two-variable logic on data words	61	1.82	2011
Optimal Zielonka-type construction of deterministic asynchronous automata	13	0.60	2010
SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings	57	2.81	2010
Verifying Recursive Active Documents with Positive Data Tree Rewriting	4	0.41	2010
Two-variable logic on data trees and XML reasoning	71	2.24	2009
A lower bound on web services composition	38	1.63	2008
Pattern Matching and Membership for Hierarchical Message Sequence Charts.	0	0.34	2008
Counting in trees	5	0.43	2008
Tree Pattern Rewriting Systems	11	0.69	2008
On Communicating Automata with Bounded Channels	9	0.56	2007
Complementing deterministic tree-walking automata	12	0.67	2006
Two-variable logic on data trees and XML reasoning	37	1.86	2006
Constructing exponential-size deterministic zielonka automata	11	0.59	2006
A Kleene theorem and model checking algorithms for existentially bounded communicating automata	40	1.38	2006
Active Context-Free Games	10	0.92	2006
Solvability Of Equations In Graph Groups Is Decidable	5	0.53	2006
Two-Variable Logic on Words with Data	110	4.15	2006
Message Sequence Charts: A Survey	4	0.42	2005
A kleene theorem for a class of communicating automata with effective algorithms	16	0.85	2004

1
2
50 / page