419 citations
- Massachusetts Institute of TechnologyUS181 papers
- Vilnius UniversityLT180 papers
- Boğaziçi UniversityTR178 papers
- Deutsches Elektronen-Synchrotron DESYDE178 papers
- University of Nebraska–LincolnUS178 papers
- Bulgarian Academy of SciencesBG176 papers
- Sofia University "St. Kliment Ohridski"BG175 papers
- University of BristolGB175 papers
- University of HelsinkiFI175 papers
- University of AntwerpBE174 papers
- University of BelgradeRS174 papers
- University of Notre DameUS174 papers
20 papers · 1 filter
Finite automata with advice tapes
Uğur Küçük, A. C. Cem Say, Abuzer Yakaryılmaz
We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is determini…
On physical problems that are slightly more difficult than QMA
Andris Ambainis
We study the complexity of computational problems from quantum physics. Typically, they are studied using the complexity class QMA (quantum counterpart of NP) but some natural comp…
Spatial Search on Grids with Minimum Memory
Andris Ambainis, Renato Portugal, Nikolay Nahimov
We study quantum algorithms for spatial search on finite dimensional grids. Patel et al. and Falk have proposed algorithms based on a quantum walk without a coin, with different op…
Magnetic wire-based sensors for the micro-rheology of complex fluids
L. Chevry, N. K. Sampathkumar, A. Cebers +1
We propose a simple micro-rheology technique to evaluate the viscoelastic properties of complex fluids. The method is based on the use of magnetic wires of a few microns in length…
Anomalies in radiation-collisional kinetics of Rydberg atoms induced by the effects of dynamical chaos and the double Stark resonance
N. N. Bezuglov, A. N. Klyucharev, A. A. Mihajlov +1
Radiative and collisional constants of excited atoms contain the matrix elements of the dipole transitions and when they are blocked one can expect occurring a number of interestin…
Unary languages recognized by two-way one-counter automata
Marzio De Biasi, Abuzer Yakaryilmaz
A two-way deterministic finite state automaton with one counter (2D1CA) is a fundamental computational model that has been examined in many different aspects since sixties, but we…