BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Croatia
1 × France
1 × Germany
1 × Norway
1 × Portugal
1 × Switzerland
1 × United Kingdom
Collaborated with:
∅ S.Rubin M.Jenkins J.Ouaknine J.Worrell Y.Velner W.Thomas V.Bárány L.Kaiser
Talks about:
problem (4) church (4) synthesi (2) tree (2) time (2) interpret (1) quantifi (1) countabl (1) automata (1) theorem (1)

Person: Alexander Rabinovich

DBLP DBLP: Rabinovich:Alexander

Contributed to:

CSL 20122012
LICS 20122012
CSL 20112011
FOSSACS 20112011
LICS 20102010
CSL 20092009
CSL 20072007

Wrote 8 papers:

CSL-2012-Rabinovich #proving #theorem
A Proof of Kamp’s theorem (AR), pp. 516–527.
LICS-2012-RabinovichR #branch
Interpretations in Trees with Countably Many Branches (AR, SR), pp. 551–560.
CSL-2011-JenkinsORW #metric #problem #synthesis
The Church Synthesis Problem with Metric (MJ, JO, AR, JW), pp. 307–321.
FoSSaCS-2011-VelnerR #problem #synthesis
Church Synthesis Problem for Noisy Input (YV, AR), pp. 275–289.
LICS-2010-JenkinsORW #automaton #bound
Alternating Timed Automata over Bounded Time (MJ, JO, AR, JW), pp. 60–69.
CSL-2009-BaranyKR #quantifier
Cardinality Quantifiers in MLO over Trees (VB, LK, AR), pp. 117–131.
CSL-2009-Rabinovich #decidability #problem
Decidable Extensions of Church’s Problem (AR), pp. 424–439.
CSL-2007-RabinovichT #logic #problem
Logical Refinements of Church’s Problem (AR, WT), pp. 69–83.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.