1
0
0
(1 - 16 von 18
)
Alexander Okhotin - UTU Research Portal - UTU Research Portal
research.utu.fi
Artur Jez, Alexander Okhotin (A1 Journal article – refereed). Grammars with two-sided contexts (2014). Electronic Proceedings in Theoretical Computer Science ...
TUCS Publication Database Search
oldtucs.abo.fi
Artur Jez, Alexander Okhotin, Unambiguous Conjunctive Grammars Over a One-Letter Alphabet. TUCS Technical Reports 1043, Turku Centre for Computer ...
One-Nonterminal Conjunctive Grammars over a Unary Alphabet. - dblpdblp.uni-trier.de › rec › conf › csr › JezO09
dblp.uni-trier.de
· Artur Jez , Alexander Okhotin : One-Nonterminal Conjunctive Grammars over a Unary Alphabet. CSR 2009: a service of Schloss ...
CSR Conferences: Best Paper Awardsras.ru
logic.pdmi.ras.ru
Artur Jez and Alexander Okhotin: Conjunctive grammars over a unary alphabet: undecidability and unbounded growth. Yury Lifshits and Dirk Nowotka: Estimation ...
Complexity of solutions of equations over sets of natural ...Archive ouverte HAL
hal.science
Artur Jez (1) , Alexander Okhotin (2). Afficher plus de détails. 1 Institute of Computer Science [Warszawa] 2 Department of Mathematics. Artur Jez.
Computer Science – Theory and Applications | SpringerLink
link.springer.com
growth” by Artur Jez and Alexander Okhotin — Best Paper in the Theory. Track. – “Estimation of the click volume by large-scale regression analysis” by Yury networking sites, such as LinkedIn, LiveJournal or MySpace. Extensive work was undertaken to optimize peer-to-peer query flood algorithms [12,26,20].
Univariate Equations Over Sets of Natural Numbers - researchr...
researchr.org
Univariate Equations Over Sets of Natural Numbers. Artur Jez, Alexander Okhotin. Univariate Equations Over Sets of Natural Numbers. Fundamenta ...
Artur Jez - researchr alias
researchr.org
Unambiguous conjunctive grammars over a one-symbol alphabetArtur Jez, Alexander Okhotin. TCS, 665:13-39, [doi] · Recompression of SLPsArtur Jez.
Complexity of solutions of equations over sets of natural ...
hal.archives-ouvertes.fr
Artur Jez, Alexander Okhotin. Complexity of solutions of equations over sets of natural numbers. STACS 2008, Feb 2008, Bordeaux, France. pp › ha...
Equations over Sets of Natural Numbers with Addition Only - Réseau de...
hal.uca.fr
Artur Jez, Alexander Okhotin. Equations over Sets of Natural Numbers with Addition Only. 26th International Symposium on Theoretical Aspects of Computer ...
DROPS - Equations over Sets of Natural Numbers with Addition Only
drops.dagstuhl.de
@InProceedings{jez_et_al:LIPIcs:2009:1806, author = {Artur Jez and Alexander Okhotin}, title = {{Equations over Sets of Natural Numbers with Addition Only}}, ...
Program - CSR-2009nsc.ru
old.math.nsc.ru
14:30-15:00, Artur Jez and Alexander Okhotin. One-nonterminal conjunctive grammars over a unary alphabet. 15:00-15:30, Galina Jiraskova.
TUCS Publication Database: Univariate Equations Over Sets of Natural...
oldtucs.abo.fi
Artur Jez, Alexander Okhotin, Univariate Equations Over Sets of Natural Numbers. TUCS Technical Reports 913, Turku Centre for Computer Science,
TUCS Publication Database: Language Equations with Addition in...
oldtucs.abo.fi
Artur Jez, Alexander Okhotin, Language Equations with Addition in Positional Notation. TUCS Technical Reports 824, Turku Centre for Computer Science,
Accepted Papers | DCFS DCC/FC/UP
www.dcc.fc.up.pt
— Artur Jez and Alexander Okhotin." "Production Complexity of Some Operations on Ciontext-Free Languages". Jürgen Dassow and Ronny Harbich. › DCFS12
Alle Infos zum Namen "Artur Jez"
sortiert nach Relevanz / Datum