Search results for "Abuzer Yakaryilmaz"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Andris Ambainis, Abuzer Yakaryilmaz	Superiority of exact quantum automata for promise problems.	Inf. Process. Lett.	2012	DBLP DOI BibTeX RDF
1	Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan	Quantum computation with write-only memory.	Natural Computing	2012	DBLP DOI BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Unbounded-error quantum computation with small space bounds.	Inf. Comput.	2011	DBLP DOI BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Tight bounds for the space complexity of nonregular language recognition by real-time machines	CoRR	2011	DBLP BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	NP has log-space verifiers with fixed-size public quantum registers	CoRR	2011	DBLP BibTeX RDF
1	Abuzer Yakaryilmaz	Classical and quantum computation with small space bounds (PhD thesis)	CoRR	2011	DBLP BibTeX RDF
1	Abuzer Yakaryilmaz	Superiority of one-way and realtime quantum machines and new directions (extended abstract)	CoRR	2011	DBLP BibTeX RDF
1	A. C. Cem Say, Abuzer Yakaryilmaz	Quantum counter automata	CoRR	2011	DBLP BibTeX RDF
1	A. C. Cem Say, Abuzer Yakaryilmaz	Computation with narrow CTCs	CoRR	2011	DBLP BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Proving the power of postselection	CoRR	2011	DBLP BibTeX RDF
1	Abuzer Yakaryilmaz	Exact quantum algorithms for promise problems in automata theory	CoRR	2011	DBLP BibTeX RDF
1	A. C. Cem Say, Abuzer Yakaryilmaz	Finite state verifiers with constant randomness	CoRR	2011	DBLP BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Probabilistic and quantum finite automata with postselection	CoRR	2011	DBLP BibTeX RDF
1	A. C. Cem Say, Abuzer Yakaryilmaz	Computation with Narrow CTCs.	UC	2011	DBLP DOI BibTeX RDF
1	Abuzer Yakaryilmaz	Superiority of One-Way and Realtime Quantum Machines and New Directions.	NCMA	2011	DBLP BibTeX RDF
1	Rusins Freivalds, Abuzer Yakaryilmaz, A. C. Cem Say	A new family of nonstochastic languages.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Succinctness of two-way probabilistic and quantum finite automata.	Discrete Mathematics & Theoretical Computer Science	2010	DBLP BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Languages recognized by nondeterministic quantum finite automata.	Quantum Information & Computation	2010	DBLP BibTeX RDF
1	Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan	Quantum computation with devices whose contents are never read	CoRR	2010	DBLP BibTeX RDF
1	A. C. Cem Say, Abuzer Yakaryilmaz	Quantum function computation using sublogarithmic space (abstract & poster)	CoRR	2010	DBLP BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Unbounded-error quantum computation with small space bounds	CoRR	2010	DBLP BibTeX RDF
1	Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan	Quantum Computation with Devices Whose Contents Are Never Read.	UC	2010	DBLP DOI BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Efficient probability amplification in two-way quantum finite automata.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Quantum Finite Automata with One-Sided Unbounded Error	CoRR	2009	DBLP BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Succinctness of two-way probabilistic and quantum finite automata	CoRR	2009	DBLP BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Language Recognition by Generalized Quantum Finite Automata with Unbounded Error	CoRR	2009	DBLP BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Languages Recognized with Unbounded Error by Quantum Finite Automata.	CSR	2009	DBLP DOI BibTeX RDF
1	Abuzer Yakaryilmaz, A. C. Cem Say	Languages recognized with unbounded error by quantum finite automata	CoRR	2008	DBLP BibTeX RDF

Publications of "Abuzer Yakaryilmaz" ( http://dblp.L3S.de/Authors/Abuzer_Yakaryilmaz )