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 × Australia
1 × Canada
1 × Finland
1 × Hungary
1 × Israel
2 × France
2 × Spain
Collaborated with:
∅ M.Karpinski K.Iwama J.Kaneps C.H.Smith T.Zeugmann G.R.Pogosyan K.Apsitis L.Fortnow W.I.Gasarch M.Kummer S.A.Kurtz F.Stephan
Talks about:
automata (7) finit (5) probabilist (3) construct (2) quantum (2) languag (2) random (2) method (2) comput (2) lower (2)

Person: Rusins Freivalds

DBLP DBLP: Freivalds:Rusins

Facilitated 2 volumes:

ICALP (1) 2013Ed
ICALP (2) 2013Ed

Contributed to:

DLT 20132013
LATA 20132013
CIAA 20092009
DLT 20072007
DLT 20072008
CIAA 20052005
ICALP 19951995
ICALP 19941994
STOC 19941994
ICALP 19911991

Wrote 12 papers:

DLT-2013-Freivalds #automaton #finite #turing machine
Ultrametric Finite Automata and Turing Machines (RF), pp. 1–11.
LATA-2013-FreivaldsZP #automaton #complexity #on the
On the Size Complexity of Deterministic Frequency Automata (RF, TZ, GRP), pp. 287–298.
CIAA-2009-Freivalds #automaton #finite
Amount of Nonconstructivity in Finite Automata (RF), pp. 227–236.
CIAA-2009-FreivaldsI #permutation #quantum #query
Quantum Queries on Permutations with a Promise (RF, KI), pp. 208–216.
DLT-2007-Freivalds #automaton #finite #probability
Non-constructive Methods for Finite Probabilistic Automata (RF), pp. 169–180.
DLT-J-2007-Freivalds08 #automaton #finite #probability
Non-Constructive Methods for Finite Probabilistic Automata (RF), pp. 565–580.
CIAA-2005-Freivalds #automaton #finite #quantum
Languages Recognizable by Quantum Finite Automata (RF), pp. 1–14.
ICALP-1995-FortnowFGKKSS #learning
Measure, Category and Learning Theory (LF, RF, WIG, MK, SAK, CHS, FS), pp. 558–569.
ICALP-1995-FreivaldsK #bound #random
Lower Time Bounds for Randomized Computation (RF, MK), pp. 183–195.
ICALP-1994-FreivaldsK #bound #random
Lower Space Bounds for Randomized Computation (RF, MK), pp. 580–592.
STOC-1994-ApsitisFS #approach #learning
Choosing a learning team: a topological approach (KA, RF, CHS), pp. 283–289.
ICALP-1991-KanepsF #automaton #probability #regular expression
Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata (JK, RF), pp. 174–185.
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.