# Dung T. Huynh

According to our database

Collaborative distances:

^{1}, Dung T. Huynh authored at least 67 papers between 1983 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Symmetric Connectivity Algotirthms in Multiple Directional Antennas Wireless Sensor Networks.

Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

2017

Antenna Orientation and Range Assignment Algorithms in Directional WSNs.

IEEE/ACM Trans. Netw., 2017

Establishing symmetric connectivity in directional wireless sensor networks equipped with 2π/3 antennas.

J. Comb. Optim., 2017

Symmetric connectivity in WSNs equipped with multiple directional antennas.

Proceedings of the 2017 International Conference on Computing, 2017

2016

Antenna orientation and range assignment in WSNs with directional antennas.

Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015

A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model.

Theor. Comput. Sci., 2015

Dual power assignment optimization and fault tolerance in WSNs.

J. Comb. Optim., 2015

Symmetric connectivity in Wireless Sensor Networks with directional antennas.

Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014

Broadcast Scheduling Problem in SINR Model.

Int. J. Found. Comput. Sci., 2014

2013

Bounded-degree minimum-radius spanning trees in wireless sensor networks.

Theor. Comput. Sci., 2013

Scheduling problems in interference-aware wireless sensor networks.

Proceedings of the International Conference on Computing, Networking and Communications, 2013

2012

Extending Order Preserving Encryption for Multi-User Systems.

IACR Cryptology ePrint Archive, 2012

Minimum latency data aggregation in the physical interference model.

Computer Communications, 2012

Connectivity in Wireless Sensor Networks in the SINR Model.

Proceedings of the 20th IEEE International Symposium on Modeling, 2012

2011

Dual power assignment optimization for k-edge connectivity in WSNs.

Proceedings of the 8th Annual IEEE Communications Society Conference on Sensor, 2011

Minimum latency data aggregation in the physical interference model.

Proceedings of the 14th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2011

The Complexity of Minimizing Receiver-Based and SINR Edge Interference.

Proceedings of 20th International Conference on Computer Communications and Networks, 2011

2010

Minimum Edge Interference in Wireless Sensor Networks.

Proceedings of the Wireless Algorithms, 2010

Minimum Data Aggregation Schedule in Wireless Sensor Networks.

Proceedings of the ISCA 23rd International Conference on Computer Applications in Industry and Engineering, 2010

Minimum Total Node Interference in Wireless Sensor Networks.

Proceedings of the Ad Hoc Networks - Second International Conference, 2010

2009

Minimum Interference Planar Geometric Topology in Wireless Sensor Networks.

Proceedings of the Wireless Algorithms, 2009

Energy-Efficient Connected D-Hop Dominating Sets in Wireless Sensor Networks.

Proceedings of the Seventh Annual IEEE International Conference on Pervasive Computing and Communications, 2009

2008

Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks.

Proceedings of the Wireless Algorithms, 2008

2007

Extending Wireless Sensor Networks Lifetime using Disjoint Connected Dominating Sets.

Proceedings of the DIALM-POMC International Workshop on Foundations of Mobile Computing, 2007

2006

Connected d-hop dominating sets in mobile ad hoc networks.

Proceedings of the 4th International Symposium on Modeling and Optimization in Mobile, 2006

Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networks.

Proceedings of the 25th IEEE International Performance Computing and Communications Conference, 2006

2000

A rearrangement algorithm for switching networks composed of digital symmetrical matrices.

Inf. Sci., 2000

Adapting d-hop dominating sets to topology changes in ad hoc networks.

Proceedings of the Proceedings Ninth International Conference on Computer Communications and Networks, 2000

1999

Adapting broadcasting sets to topology changes in packet radio networks.

Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1999), 1999

Dynamic Software Architecture Slicing.

Proceedings of the 23rd International Computer Software and Applications Conference (COMPSAC '99), 1999

1995

Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2

Inf. Comput., May, 1995

On Deciding Readiness and Failure Equivalences for Processes

Inf. Comput., March, 1995

1994

A Note on the Complexity of Deciding Bisimilarity of Normed Unary Processes.

Theor. Comput. Sci., 1994

Deciding Bisimilarity of Normed Context-Free Processes is in Sigma^p_2.

Theor. Comput. Sci., 1994

On Deciding some Equivalences for Concurrent Processes.

ITA, 1994

1993

On deciding trace equivalences for processes.

Inf. Sci., 1993

On the Complexity of Bisimilarity of Normed Probabilistic Context-Free Processes.

Proceedings of the Computing and Information, 1993

On the Rearrangeability of Switching Networks Composed of Digital Symmetrical Matrices.

Proceedings of the Computing and Information, 1993

1992

The Parallel Complexity of Finite-State Automata Problems

Inf. Comput., March, 1992

Nonuniform Complexity and the Randomness of Certain Complete Languages.

Theor. Comput. Sci., 1992

The Parallel Complexity of Coarsest Set Partition Problems.

Inf. Process. Lett., 1992

The Complexity of Deciding Code and Monoid Properties for Regular Sets.

IJAC, 1992

On some equivalence relations for probabilistic processes.

Fundam. Inform., 1992

Complexity of Closeness, Sparseness and Segment Equivalence for Context-Free and Regular Languages.

Proceedings of the Informatik, Festschrift zum 60. Geburtstag von Günter Hotz, 1992

1991

A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes

Inf. Comput., May, 1991

Effective Entropies and Data Compression

Inf. Comput., January, 1991

Finite-Automaton Aperiodicity is PSPACE-Complete.

Theor. Comput. Sci., 1991

The Effective Entropies of Some Extensions of Context-Free Languages.

Inf. Process. Lett., 1991

Efficient Detectors and Constructors for Single Languages.

Int. J. Found. Comput. Sci., 1991

The complexity of readiness and failure equivalences for processes.

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

1990

The Complexity of Ranking Simple Languages.

Mathematical Systems Theory, 1990

The complexity of membership for deterministic growing context-sensitive grammars.

Int. J. Comput. Math., 1990

1988

On a Complexity Hierarchy Between L and NL.

Inf. Process. Lett., 1988

The complexity of ranking.

Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

1987

On Solving Hard Problems by Polynomial-Size Circuits.

Inf. Process. Lett., 1987

A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees.

Proceedings of the STACS 87, 1987

1986

Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States.

Theor. Comput. Sci., 1986

Some Observations about the Randomness of Hard Problems.

SIAM J. Comput., 1986

The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals.

SIAM J. Comput., 1986

A Superexponential Lower Bound for Gröbner Bases and Church-Rosser Commutative Thue Systems

Information and Control, 1986

A Simple Proof for the Sum

^{p}_{2}Upper Bound of the Inequivalence Problem for Semilinear Sets.
Elektronische Informationsverarbeitung und Kybernetik, 1986

Resource- Bounded Kolmogorov Complexity of Hard Languages.

Proceedings of the Structure in Complexity Theory, 1986

1985

The Complexity of Equivalence Problems for Commutative Grammars

Information and Control, 1985

Complexity of the Word Problem for Commutative Semigroups of Fixed Dimension.

Acta Inf., 1985

The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984

Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-Complete.

Theor. Comput. Sci., 1984

1983

Commutative Grammars: The Complexity of Uniform Word Problems

Information and Control, April, 1983