Sabine Broda - Citegraph

Author Info

Name	Affiliation	Papers
SABINE BRODA	Univ Porto, LIACC, Fac Ciencias, Rua Campo Alegre 1021-1055, P-4169007 Oporto, Portugal	35
Collaborators	Citations	PageRank
18	64	13.83
Referers	Referees	References
62	207	217

Search Limit

100207

Publications (35 rows)

Collaborators (18 rows)

Referers (62 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
On Average Behaviour Of Regular Expressions In Strong Star Normal Form	0	0.34	2019
Pre-grammars and Inhabitation for a Subset of Rank 2 Intersection Types.	0	0.34	2019
A mesh of automata.	0	0.34	2019
Position Automata for Semi-extended Expressions.	0	0.34	2018
Automata for regular expressions with shuffle.	2	0.37	2018
A Unifying Framework for Type Inhabitation.	0	0.34	2018
On the Average Complexity of Partial Derivative Automata for Semi-extended Expressions.	0	0.34	2017
On The Average Complexity Of Strong Star Normal Form	0	0.34	2017
Inhabitation machines: determinism and principality.	0	0.34	2017
On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection.	1	0.37	2016
Position Automaton Construction for Regular Expressions with Intersection.	0	0.34	2016
The G-ACM Tool: using the Drools Rule Engine for Access Control Management.	0	0.34	2016
Average Size of Automata Constructions from Regular Expressions.	0	0.34	2015
Deciding Synchronous Kleene Algebra with Derivatives	1	0.36	2015
A Typed Language for Events.	0	0.34	2015
Partial Derivative Automaton for Regular Expressions with Shuffle.	2	0.38	2015
A short note on type-inhabitation: Formula-trees vs. game semantics	0	0.34	2015
A Hitchhiker's Guide to descriptional complexity through analytic combinatorics	7	0.54	2014
On the Equivalence of Automata for KAT-expressions.	2	0.36	2014
On the average size of glushkov and equation automata for KAT expressions	3	0.39	2013
Deciding Kat And Hoare Logic With Derivatives	4	0.42	2012
On The Average Size Of Glushkov And Partial Derivative Automata	12	0.65	2012
The average transition complexity of Glushkov and partial derivative automata	2	0.36	2011
On The Average State Complexity Of Partial Derivative Automata: An Analytic Combinatorics Approach	6	0.56	2011
On the average number of states of partial derivative automata	2	0.36	2010
On Principal Types of BCK- lambda -Terms	0	0.34	2007
On Long Normal Inhabitants of a Type	9	0.66	2005
The decidability of a fragment of BB'IW-logic	2	0.50	2004
Studying provability in implicational intuitionistic logic the formula tree approach	1	0.40	2002
A Context-Free Grammar Representation for Normal Inhabitants of Types in TAlambda	3	0.60	2001
On principal types of combinators	0	0.34	2000
Compact Bracket Abstraction in Combinatory Logic	3	0.44	1997
On combinatory complete sets of proper combinators	0	0.34	1997
A New Translation Algorithm from Lambda Calculus into Combinatory Logic	1	0.37	1995
Resolution of Constraints in Algebras of Rational Trees	1	0.34	1993