#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1991

2012

- This year (0)
- Last 5 years (3)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Nicholas Q. Trân
- CPM
- 1997

We show that a special case of sorting by reversals can be performed in polynomial time, namely, when the number of breakpoints is twice the distance.

- Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang
- SIAM J. Comput.
- 1995

- Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang
- ICALP
- 1993

- Nicholas Q. Trân
- Structure in Complexity Theory Conference
- 1995

We show that every m-complete set for NEXP as well as ats complement have an infinite subset in P. Thw nnswers an open question first raised in [Ber76].

- Oscar H. Ibarra, Nicholas Q. Trân
- Theor. Comput. Sci.
- 1993

It is well known that programs using only the following constructs: {x+x+ 1, X+-.X I 1, if x =0 then goto I, goto 1, halt} compute all partial recursive functions [7]. In fact, Minsky showed that simple programs with three variables compute all partial recursive functions with one argument and, consequently, simple programs with three variables recognize… (More)

- Oscar H. Ibarra, Nicholas Q. Trân
- Theor. Comput. Sci.
- 2011

- Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang
- STACS
- 1993

- Oscar H. Ibarra, Nicholas Q. Trân
- Theor. Comput. Sci.
- 1991

We continue the study of the computational power of synchronized alternating Turing machines (S.4 T.M) introduced in (Hromkovi? 1986, Slohodob$ 1987. 19883. h) IO allow communication via synchromzation among processes of alternating Turing machines. We are interested m comparing the four main clasbcs of space-bounded synchronized alternating Turing-machines… (More)

- Ömer Egecioglu, Oscar H. Ibarra, Nicholas Q. Trân
- SOFSEM
- 2012

Given an n-tape nondeterministic finite automaton (NFA) M with a one-way read-only head per tape and a right end marker $ on each tape, and a nonnegative integer k, we say that M is weakly ksynchronized if for every n-tuple x = (x1, . . . , xn) that is accepted, there is a computation on x such that at any time during the computation, no pair of input… (More)

- Oscar H. Ibarra, Nicholas Q. Trân
- Acta Informatica
- 1994

We continue the study of communication-bounded synchronized alternating finite automata (SAFA), first considered by Hromkovič et al. We show that to accept a nonregular language, an SAFA needs to generate at least Ω(log logn) communication symbols infinitely often; furthermore, a synchronized alternating finite automaton without nondeterminism (SUFA) needs… (More)