#### Filter Results:

- Full text PDF available (26)

#### Publication Year

1999

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Nathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki
- Theory of Computing
- 2010

We investigate the role of nondeterminism in Winfree's abstract tile assembly model, which was conceived to model artificial molecular self-assembling systems constructed from DNA. By nondeterminism we do not mean a magical ability such as that possessed by a nondeterministic algorithm to search an exponential-size space in polynomial time. Rather, we study… (More)

- Peyman Afshani, Ehsan Chiniforooshan, +4 authors Hamid Zarrabi-Zadeh
- COCOON
- 2007

We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, we make a few assumptions which allow us to obtain an algorithm with the worst case query complexity of O(k) + 2k log n k in which k is the number of vertices adjacent to… (More)

- Ehsan Chiniforooshan, Mark Daley, Oscar H. Ibarra, Lila Kari, Shinnosuke Seki
- Theor. Comput. Sci.
- 2011

We investigate the power of (1-reversal) counter machines (finite automata with multiple counters, where each counter can ‘‘reverse’’ only once, i.e., once a counter decrements, it can no longer increment) and one-way multihead finite automata (finite automata with multiple one-way input heads) as a language acceptor. They can be non-deterministic as well… (More)

- Ehsan Chiniforooshan
- Journal of Graph Theory
- 2008

In this note,we prove that the cop number of any n-vertex graph G, denoted by c(G), is at most O ( n lgn ) . Meyniel conjectured c(G) = O(√n). It appears that the best previously known sublinear upper-bound is due to Frankl, who proved c(G) ≤ (1+ o(1)) lgn . © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 45–48, 2008

- Manuela M. Veloso, Tucker R. Balch, +12 authors Ehsan Chiniforooshan
- AI Magazine
- 2002

RoboCup-2001 was the Fifth International RoboCup Competition and Conference (figure 1). It was held for the first time in the United States, following RoboCup-2000 in Melbourne, Australia; RoboCup-99 in Stockholm; RoboCup-98 in Paris; and RoboCup-97 in Osaka. RoboCup is a research-oriented initiative that pioneered the field of multirobot research of robot… (More)

- Anthony Bonato, Ehsan Chiniforooshan, Pawel Pralat
- Theor. Comput. Sci.
- 2010

Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where the cops win if at least one of them is of distance at most k from the robber in G. The cop number of a graph G is the minimum number of cops needed to capture the robber in G. The… (More)

- Anthony Bonato, Ehsan Chiniforooshan
- ANALCO
- 2009

Cops and Robber is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robber, distance k Cops and Robber, where the cops win if they are distance at most k from the robber in G. The cop number of a graph G is the minimum number of cops needed to capture the robber in G. The distance k analogue… (More)

Constructing soccer robots is an attempt in development of AI researches, done by defining a standard problem and solving it by many researchers all over the world. In this field, every year a formal federation holds international competitions, called RoboCup [1]. The Simulation League is one of the branches of the RoboCup. We have designed and implemented… (More)

- Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh
- ICALP
- 2005

We consider the problem of evaluating an expression consisting of unions and intersections of some sorted sets in the comparison model. Given the expression and the sizes of the sets, we are interested in the worst-case complexity of evaluating the expression in terms of the sizes of the sets. We assume the sets in the given expression are independent. We… (More)

- Ehsan Chiniforooshan, Vasek Chvátal
- Discrete Mathematics & Theoretical Computer…
- 2011

De Bruijn and Erdős proved that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvátal suggested a possible generalization of this theorem in the framework of metric spaces. We provide partial results in this direction.