BibSLEIGH — Oscar_H

Travelled to:

1 × Austria
1 × Belgium
1 × Finland
1 × Greece
1 × Hungary
1 × Israel
1 × Italy
1 × Japan
1 × New Zealand
1 × South Africa
1 × Sweden
1 × The Netherlands
10 × USA
2 × Portugal
2 × United Kingdom
3 × Germany
3 × Spain
4 × France
5 × Canada

Collaborated with:

∅ Z.Dang B.Ravikumar N.Q.Trân H.Yen J.Su E.M.Gurari T.Bultan S.Seki F.Yu B.S.Leininger T.Jiang J.Eremondi I.McQuillan G.Xie P.Frisco C.E.Kim R.A.Kemmerer T.Yang T.R.Smith H.Zhu Z.Sun H.Mokhtar J.H.Chang M.A.Palis S.M.Kim L.E.Rosier S.Moran C.Cui T.R.Fischer C.Li P.S.Pietro T.Harju J.Karhumäki A.Salomaa H.Wang D.Andresen Ö.Egecioglu H.Zhu Q.Zheng D.Watson

Talks about:

automata (12) problem (12) machin (10) languag (8) verif (8) way (8) system (7) decis (7) bound (7) time (7)

Person: Oscar H. Ibarra

DBLP: Ibarra:Oscar_H=

Facilitated 8 volumes:

Contributed to:

2015

2014

2013

2014

2013

2012

2013

2012

2011

2012

2011

2010

2011

2010

2009

2005

2004

2005

2003

2002

2001

2000

2002

1998

1997

1993

1992

1988

1987

1984

1981

1980

1979

1978

1976

1996

Wrote 51 papers:

DLT-2015-EremondiIM #on the: On the Density of Context-Free and Counter Languages (JE, OHI, IM), pp. 228–239.
LATA-2015-EremondiIM #bound: Insertion Operations on Deterministic Reversal-Bounded Counter Machines (JE, OHI, IM), pp. 200–211.
CIAA-2014-Ibarra #ambiguity #on the #problem #transducer: On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers (OHI), pp. 211–225.
LATA-2014-IbarraR #on the #problem: On the Parikh Membership Problem for FAs, PDAs, and CMs (OHI, BR), pp. 14–31.
CIAA-2013-IbarraR #problem: Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages (OHI, BR), pp. 193–207.
DLT-2013-IbarraR #complexity: Some Decision Questions Concerning the Time Complexity of Language Acceptors (OHI, BR), pp. 264–276.
DLT-J-2013-IbarraR14 #complexity: Some Decision Questions Concerning the Time Complexity of Language Acceptors (OHI, BR), pp. 1127–1140.
LATA-2013-CuiDFI #automaton #execution: Execution Information Rate for Some Classes of Automata (CC, ZD, TRF, OHI), pp. 226–237.
LATA-2013-IbarraR #automaton #bound #on the: On Bounded Languages and Reversal-Bounded Automata (OHI, BR), pp. 359–370.
CIAA-2012-IbarraT #automaton #how #multi: How to Synchronize the Heads of a Multitape Automaton (OHI, NQT), pp. 192–204.
CIAA-J-2012-IbarraT13 #automaton #how #multi: How to synchronize the Heads of a Multitape Automaton (OHI, NQT), pp. 799–814.
LATA-2012-IbarraT #automaton #multi #turing machine: Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines (OHI, NQT), pp. 337–350.
AFL-2011-IbarraS #bound #linear: Characterizations of Bounded Semilinear Languages by One-Way and Two-way Deterministic Machines (OHI, SS), pp. 211–224.
AFL-J-2011-IbarraS12 #bound #linear: Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines (OHI, SS), pp. 1291–1306.
CIAA-2011-Ibarra #equivalence #linear #on the #problem #transducer: On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs (OHI), pp. 190–202.
DLT-2011-IbarraY #on the #transducer: On Two-Way Transducers (OHI, HCY), pp. 300–311.
CIAA-2010-YuBI #automaton #multi #relational #string #using #verification: Relational String Verification Using Multi-track Automata (FY, TB, OHI), pp. 290–299.
CIAA-J-2010-YuBI11 #automaton #multi #relational #string #using #verification: Relational String Verification Using Multi-Track Automata (FY, TB, OHI), pp. 1909–1924.
DLT-2010-Ibarra #on the #problem: On Decision Problems for Simple and Parameterized Machines (OHI), p. 31.
DLT-2009-FriscoI #automaton #finite #multi #on the: On Stateless Multihead Finite Automata and Multihead Pushdown Automata (PF, OHI), pp. 240–251.
TACAS-2009-YuBI #analysis #string #verification: Symbolic String Verification: Combining String Analysis and Size Analysis (FY, TB, OHI), pp. 322–336.
CIAA-2005-IbarraY #on the: On Deterministic Catalytic Systems (OHI, HCY), pp. 163–175.
ICALP-2005-LiDIY #problem #verification: Signaling P Systems and Verification Problems (CL, ZD, OHI, HCY), pp. 1462–1473.
CIAA-2004-Ibarra #infinity: Automata-Theoretic Techniques for Analyzing Infinite-State Systems (OHI), p. 1.
DLT-2004-IbarraYD #parallel #power of: The Power of Maximal Parallelism in P Systems (OHI, HCY, ZD), pp. 212–224.
DLT-J-2004-IbarraYD05 #on the #parallel: On various notions of parallelism in P Systems (OHI, HCY, ZD), pp. 683–705.
CAV-2003-XieDIP #problem #verification: Dense Counter Machines and Verification Problems (GX, ZD, OHI, PSP), pp. 93–105.
ICALP-2003-XieDI #equation #infinity #polynomial #verification: A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems (GX, ZD, OHI), pp. 668–680.
CIKM-2002-ZhuSI #database #query: Trajectory queries and octagons in moving object databases (HZ, JS, OHI), pp. 413–421.
DLT-2002-IbarraDS #automaton #finite #safety #verification: Safety Verification for Two-Way Finite Automata with Monotonic Counters (OHI, ZD, ZWS), pp. 326–338.
PODS-2002-MokhtarSI #on the #query: On Moving Object Queries (HM, JS, OHI), pp. 188–198.
CIAA-2001-DangBIK #automaton: Past Pushdown Timed Automata (ZD, TB, OHI, RAK), pp. 74–86.
ICALP-2001-HarjuIKS #morphism: Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages (TH, OHI, JK, AS), pp. 579–590.
CAV-2000-DangIBKS #analysis #automaton #reachability: Binary Reachability Analysis of Discrete Pushdown Timed Automata (ZD, OHI, TB, RAK, JS), pp. 69–84.
CIAA-2000-Ibarra #queue #reachability #safety: Reachability and Safety in Queue Systems (OHI), pp. 145–156.
CIAA-2000-IbarraS #automaton: Generalizing the Discrete Timed Automaton (OHI, JS), pp. 157–169.
CIAA-J-2000-Ibarra02 #multi #verification: Verification in Queue-Connected Multicounter Machines (OHI), pp. 115–127.
HPDC-1998-ZhuYZWIS #adaptation #clustering #library: Adaptive Load Sharing for Clustered Digital Library Servers (HZ, TY, QZ, DW, OHI, TRS), pp. 235–242.
PODS-1997-IbarraS #constraints #database #equivalence #linear #on the #query: On the Containment and Equivalence of Database Queries with Linear Constraints (OHI, JS), pp. 32–43.
ICALP-1993-IbarraJTW #decidability: New Decidability Results Concerning Two-way Counter Machines and Applications (OHI, TJ, NQT, HW), pp. 313–324.
ICALP-1992-IbarraT #automaton #finite: New Results Concerning Synchronized Finite Automata (OHI, NQT), pp. 126–137.
ICALP-1988-ChangIP #bound #modelling #parallel #performance #simulation: Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM’s and Space-Bounded TM’s (JHC, OHI, MAP), pp. 119–132.
ICALP-1987-IbarraJ #array #on the #power of: On the Computing Power of One-Way Cellular Arrays (OHI, TJ), pp. 550–562.
ICALP-1984-IbarraKR #performance #simulation #strict: Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs (OHI, SMK, LER), pp. 247–259.
ICALP-1981-GurariI #complexity #multi #problem: The Complexity of Decision Problems for Finite-Turn Multicounter Machines (EMG, OHI), pp. 495–505.
ICALP-1981-IbarraLM #complexity #on the: On the Complexity of Simple Arithmetic Expressions (OHI, BSL, SM), pp. 294–304.
STOC-1980-IbarraL #complexity #equivalence #problem #source code: The Complexity of the Equivalence Problem for Straight-Line Programs (OHI, BSL), pp. 273–280.
STOC-1979-GurariI #complexity #equivalence #linear #problem #set #source code: The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs (EMG, OHI), pp. 142–152.
STOC-1978-GurariI #problem: An NP-Complete Number-Theoretic Problem (EMG, OHI), pp. 205–215.
STOC-1976-IbarraK #problem: A Useful Device for Showing the Solvability of Some Decision Problems (OHI, CEK), pp. 135–140.
ADL-1996-AndresenYEIS #library #performance #scalability #web: Scalability Issues for High Performance Digital Libraries on the World Wide Web (DA, TY, ÖE, OHI, TRS), pp. 139–148.