Zhe Dang

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 12

Top Topics

Regular Languages

Semantic Similarity Computation

Top Venues

Theor. Comput. Sci.

Publications

Xiujun Wang, Zhi Liu, Alex X. Liu, Xiao Zheng, Hao Zhou, Ammar Hawbani, Zhe Dang
A Near-Optimal Protocol for Continuous Tag Recognition in Mobile RFID Systems. IEEE/ACM Trans. Netw. 32 (2) (2024)
Xiujun Wang, Zhi Liu, Yan Gao, Xiao Zheng, Zhe Dang, Xiaojun Shen
A Near-Optimal Protocol for the Grouping Problem in RFID Systems. IEEE Trans. Mob. Comput. 20 (4) (2021)
Xiujun Wang, Zhi Liu, Susumu Ishihara, Zhe Dang, Jie Li
A Near-optimal Protocol for the Subset Selection Problem in RFID Systems. MSN (2020)
Oscar H. Ibarra, Zhe Dang, Qin Li
Accepting runs in a two-way finite automaton. Inf. Comput. 260 (2018)
Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra
Information rate of some classes of non-regular languages: An automata-theoretic approach. Inf. Comput. 256 (2017)
Oscar H. Ibarra, Cewei Cui, Zhe Dang, Thomas R. Fischer
Lossiness of communication channels modeled by transducers. Comput. 6 (2) (2017)
Cewei Cui, Zhe Dang
Random Words in a (Weighted) Regular Language: a Free Energy Approach. CoRR (2017)
Zhe Dang, Thomas R. Fischer, William J. Hutton III, Oscar H. Ibarra, Qin Li
Quantifying communication in synchronized languages. Theor. Comput. Sci. 654 (2016)
Cewei Cui, Zhe Dang
Canonical Number and NutCracker: Heuristic Algorithms for the Graph Isomorphism Problem using Free Energy. CoRR (2016)
Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra
Execution information rate for some classes of automata. Inf. Comput. 246 (2016)
Cewei Cui, Zhe Dang
A Free Energy Foundation of Semantic Similarity in Automata and Languages. CoRR (2016)
Cewei Cui, Zhe Dang
A Free Energy Foundation of Semantic Similarity in Automata and Languages. SISAP (2016)
Zhe Dang, Thomas R. Fischer, William J. Hutton III, Oscar H. Ibarra, Qin Li
Quantifying Communication in Synchronized Languages. COCOON (2015)
Xiujun Wang, Yusheng Ji, Zhe Dang, Xiao Zheng, Baohua Zhao
Improved Weighted Bloom Filter and Space Lower Bound Analysis of Algorithms for Approximated Membership Querying. DASFAA (2) (2015)
Eric Shing-Suan Wang, Zhe Dang
A Message-Passing Architecture without Public Ids Using Send-to-Behavior. ASE (2015)
Qin Li, Zhe Dang
Sampling automata and programs. Theor. Comput. Sci. 577 (2015)
Zhe Dang, Dmitry Dementyev, Thomas R. Fischer, William J. Hutton III
Security of Numerical Sensors in Automata. CIAA (2015)
Oscar H. Ibarra, Cewei Cui, Zhe Dang, Thomas R. Fischer
Lossiness of Communication Channels Modeled by Transducers. CiE (2014)
Xiujun Wang, Xiao Zheng, Zhe Dang, Xuangou Wu, Baohua Zhao
Near-Optimal Approximate Duplicate-Detection in Data Streams Over Sliding Windows for the Uniform Query Frequency or Membership Likelihood. CBD (2014)
Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra
Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach - (Extended Abstract). MFCS (1) (2014)
Eric Wang, Cewei Cui, Zhe Dang, Thomas R. Fischer, Linmin Yang
Zero-Knowledge Blackbox Testing: where are the Faults? Int. J. Found. Comput. Sci. 25 (2) (2014)
Cewei Cui, Zhe Dang, Thomas R. Fischer
Bit Rate of Programs. CoRR (2013)
Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra
Execution Information Rate for Some Classes of Automata. LATA (2013)
Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra
Similarity in languages and programs. Theor. Comput. Sci. 498 (2013)
Linmin Yang, Zhe Dang, Thomas R. Fischer
Information gain of black-box testing. Formal Aspects Comput. 23 (4) (2011)
Cewei Cui, Zhe Dang, Thomas R. Fischer
Typical Paths of a Graph. Fundam. Informaticae 110 (1-4) (2011)
Linmin Yang, Zhe Dang, Oscar H. Ibarra
Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing. Nat. Comput. 9 (2) (2010)
Linmin Yang, Yong Wang, Zhe Dang
Automata and processes on multisets of communicating objects. Nat. Comput. 9 (4) (2010)
Linmin Yang, Zhe Dang, Thomas R. Fischer, Min Sik Kim, Li Tan
Entropy and software systems: towards an information-theoretic foundation of software testing. FoSER (2010)
Linmin Yang, Zhe Dang, Thomas R. Fischer
Optimal Software Testing - A Cooling Down Process. FCS (2009)
Linmin Yang, Zhe Dang, Oscar H. Ibarra
On Stateless Automata and P Systems. Int. J. Found. Comput. Sci. 19 (5) (2008)
Oscar H. Ibarra, Zhe Dang, Linmin Yang
On Counter Machines, Reachability Problems, and Diophantine Equations. Int. J. Found. Comput. Sci. 19 (4) (2008)
Linmin Yang, Yong Wang, Zhe Dang
Automata on Multisets of Communicating Objects. UC (2008)
Linmin Yang, Zhe Dang, Oscar H. Ibarra
Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing. UC (2007)
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
On the Decidability of Model-Checking for P Systems. J. Autom. Lang. Comb. 11 (3) (2006)
Cheng Li, Zhe Dang
Decompositional Algorithms for Safety Verification and Testing of Aspect-Oriented Systems. FATES/RV (2006)
Oscar H. Ibarra, Zhe Dang
On the solvability of a class of diophantine equations and applications. Theor. Comput. Sci. 352 (1-3) (2006)
Shuohao Zhang, Curtis E. Dyreson, Zhe Dang
Compacting XML Data. DASFAA (2006)
Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang
On the Computational Power of 1-Deterministic and Sequential P Systems. Fundam. Informaticae 73 (1-2) (2006)
Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang
On Symport/Antiport P Systems and Semilinear Sets. Workshop on Membrane Computing (2005)
Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun
On two-way nondeterministic finite automata with one reversal-bounded counter. Theor. Comput. Sci. 330 (1) (2005)
Gaoyan Xie, Zhe Dang
Testing Systems of Concurrent Black-Boxes-An Automata-Theoretic and Decompositional Approach. FATES (2005)
Zhe Dang, Oscar H. Ibarra
On one-membrane P systems operating in sequential mode. Int. J. Found. Comput. Sci. 16 (5) (2005)
Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang
On various notions of parallelism in P Systems. Int. J. Found. Comput. Sci. 16 (4) (2005)
Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang
On Sequential and 1-Deterministic P Systems. COCOON (2005)
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
On Model-Checking of P Systems. UC (2005)
Cheng Li, Zhe Dang, Oscar H. Ibarra, Hsu-Chun Yen
Signaling P Systems and Verification Problems. ICALP (2005)
Zhe Dang, Oscar H. Ibarra, Jianwen Su
. Theor. Comput. Sci. 341 (1-3) (2005)
Gaoyan Xie, Zhe Dang
Testing Systems of Concurrent Black-boxes - an Automata-Theoretic and Decompositional Approach CoRR (2005)
Gaoyan Xie, Zhe Dang
An Automata-Theoretic Approach for Model-Checking Systems with Unspecified Components. FATES (2004)
Gaoyan Xie, Cheng Li, Zhe Dang
Testability of Oracle Automata. CIAA (2004)
Zhe Dang, Oscar H. Ibarra
On P Systems Operating in Sequential Mode. DCFS (2004)
Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu
Catalytic P systems, semilinear sets, and vector addition systems. Theor. Comput. Sci. 312 (2-3) (2004)
Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang
The Power of Maximal Parallelism in P Systems. Developments in Language Theory (2004)
Gaoyan Xie, Zhe Dang
Model-checking Driven Black-box Testing Algorithms for Systems with Unspecified Components CoRR (2004)
Gaoyan Xie, Cheng Li, Zhe Dang
Linear reachability problems and minimal solutions to linear Diophantine equation systems. Theor. Comput. Sci. 328 (1-2) (2004)
Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer
Past pushdown timed automata and safety verification. Theor. Comput. Sci. 313 (1) (2004)
Zhe Dang, Oscar H. Ibarra, Jianwen Su
Composability of Infinite-State Activity Automata. ISAAC (2004)
Oscar H. Ibarra, Zhe Dang
On two-way FA with monotonic counters and quadratic Diophantine equations. Theor. Comput. Sci. 312 (2-3) (2004)
Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie
Real-Counter Automata and Their Decision Problems. FSTTCS (2004)
Oscar H. Ibarra, Zhe Dang, Pierluigi San Pietro
Verification in loosely synchronous queue-connected discrete timed automata. Theor. Comput. Sci. 290 (3) (2003)
Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena
Characterizations of Catalytic Membrane Computing Systems. MFCS (2003)
Gaoyan Xie, Cheng Li, Zhe Dang
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations. CIAA (2003)
Gaoyan Xie, Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro
Dense Counter Machines and Verification Problems. CAV (2003)
Gaoyan Xie, Zhe Dang, Oscar H. Ibarra
A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems. ICALP (2003)
Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer
Generalized discrete timed automata: decidable approximations for safety verificatio. Theor. Comput. Sci. 296 (1) (2003)
Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer
Presburger liveness verification of discrete timed automata. Theor. Comput. Sci. 299 (1-3) (2003)
Pierluigi San Pietro, Zhe Dang
Automatic Verification of Multi-queue Discrete Timed Automata. COCOON (2003)
Zhe Dang
Pushdown timed automata: a binary reachability characterization and safety verification. Theor. Comput. Sci. 302 (1-3) (2003)
Oscar H. Ibarra, Zhe Dang
Eliminating the storage tape in reachability constructions. Theor. Comput. Sci. 299 (1-3) (2003)
Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter. ISAAC (2002)
Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer
Counter Machines and Verification Problems. Theor. Comput. Sci. 289 (1) (2002)
Oscar H. Ibarra, Zhe Dang, Zhi-Wei Sun
Safety Verification for Two-Way Finite Automata with Monotonic Counters. Developments in Language Theory (2002)
Zhe Dang, Oscar H. Ibarra
The Existence of w-Chains for Transitive Mixed Linear Relations and Its Applications. Int. J. Found. Comput. Sci. 13 (6) (2002)
Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata. COCOON (2001)
Zhe Dang
The Existence of $\omega$-Chains for Transitive Mixed Linear Relations and Its Applications CoRR (2001)
Zhe Dang
Pushdown Timed Automata: a Binary Reachability Characterization and Safety Verification CoRR (2001)
Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter. FSTTCS (2001)
Oscar H. Ibarra, Zhe Dang
On Removing the Pushdown Stack in Reachability Constructions. ISAAC (2001)
Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer
On Presburger Liveness of Discrete Timed Automata. STACS (2001)
Zhe Dang
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks. CAV (2001)
Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer
Past Pushdown Timed Automata. CIAA (2001)
Zhe Dang, Oscar H. Ibarra, Tevfik Bultan, Richard A. Kemmerer, Jianwen Su
Binary Reachability Analysis of Discrete Pushdown Timed Automata. CAV (2000)
Zhe Dang, Richard A. Kemmerer
Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems. ICSE (2000)
Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer
Conter Machines: Decidable Properties and Applications to Verification Problems. MFCS (2000)
Zhe Dang, Richard A. Kemmerer
Using the ASTRAL Model Checker to Analyze Mobile IP. ICSE (1999)
Paul Z. Kolano, Zhe Dang, Richard A. Kemmerer
The Design and Analysis of Real-Time Systems Using the ASTRAL Software Development Environment. Ann. Softw. Eng. 7 (1999)
Zhe Dang, Richard A. Kemmerer
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications. RTCSA (1999)