Dung T. Huynh

J. Comb. Optim., May, 2023

Target Coverage and Connectivity in Directional Wireless Sensor Networks.

[BibT_eX]

[DOI]

Tan D. Lam

Proceedings of the IEEE INFOCOM 2023, 2023

2022

Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2022

2020

The complexity of symmetric connectivity in directional wireless sensor networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

2018

Symmetric Connectivity Algotirthms in Multiple Directional Antennas Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

2017

Antenna Orientation and Range Assignment Algorithms in Directional WSNs.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2017

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Symmetric connectivity in WSNs equipped with multiple directional antennas.

[BibT_eX]

[DOI]

Proceedings of the 2017 International Conference on Computing, 2017

2016

Antenna orientation and range assignment in WSNs with directional antennas.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Dual power assignment optimization and fault tolerance in WSNs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Symmetric connectivity in Wireless Sensor Networks with directional antennas.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014

Broadcast Scheduling Problem in SINR Model.

[BibT_eX]

[DOI]

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

2013

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Scheduling problems in interference-aware wireless sensor networks.

[BibT_eX]

[DOI]

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

2012

Extending Order Preserving Encryption for Multi-User Systems.

[BibT_eX]

[DOI]

Liangliang Xiao

I-Ling Yen

IACR Cryptol. ePrint Arch., 2012

Minimum latency data aggregation in the physical interference model.

[BibT_eX]

[DOI]

Comput. Commun., 2012

Connectivity in Wireless Sensor Networks in the SINR Model.

[BibT_eX]

[DOI]

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

2011

Minimum Data Aggregation Schedule in Wireless Sensor Networks.

[BibT_eX]

Int. J. Comput. Their Appl., 2011

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

2010

Minimum Edge Interference in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Wireless Algorithms, 2010

Minimum Total Node Interference in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Nhat X. Lam

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

2009

Minimum Interference Planar Geometric Topology in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Wireless Algorithms, 2009

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Jason A. Bolla

Proceedings of the Wireless Algorithms, 2008

2007

Extending Wireless Sensor Networks Lifetime using Disjoint Connected Dominating Sets.

[BibT_eX]

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

2006

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Jason A. Bolla

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

2005

PatZip: Pattern-Preserved Spatial Data Compression.

[BibT_eX]

[DOI]

Yu Qian

Kang Zhang

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2005

2001

Dynamic slicing object-oriented programs using dynamic object relationship diagrams.

[BibT_eX]

[DOI]

Yeong-Tae Song

ACIS Int. J. Comput. Inf. Sci., 2001

2000

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

[BibT_eX]

[DOI]

Hai N. Nguyen

Inf. Sci., 2000

Software architecture analysis: a dynamic slicing approach.

[BibT_eX]

[DOI]

ACIS Int. J. Comput. Inf. Sci., 2000

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

[BibT_eX]

[DOI]

Thai H. P. Vuong

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

1999

Adapting broadcasting sets to topology changes in packet radio networks.

[BibT_eX]

[DOI]

Thai H. P. Vuong

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

Dynamic Software Architecture Slicing.

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

Didier Caucal

Inf. Comput., May, 1995

On Deciding Readiness and Failure Equivalences for Processes

[BibT_eX]

[DOI]

Inf. Comput., March, 1995

1994

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

On Deciding some Equivalences for Concurrent Processes.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1994

1993

On deciding trace equivalences for processes.

[BibT_eX]

[DOI]

Inf. Sci., 1993

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

[BibT_eX]

Proceedings of the Computing and Information, 1993

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

[BibT_eX]

Hai N. Nguyen

Proceedings of the Computing and Information, 1993

1992

The Parallel Complexity of Finite-State Automata Problems

[BibT_eX]

[DOI]

Inf. Comput., March, 1992

Nonuniform Complexity and the Randomness of Certain Complete Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

The Parallel Complexity of Coarsest Set Partition Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

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

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1992

On some equivalence relations for probabilistic processes.

[BibT_eX]

Fundam. Informaticae, 1992

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

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

John G. Geske

Joel I. Seiferas

Inf. Comput., May, 1991

Effective Entropies and Data Compression

[BibT_eX]

[DOI]

Inf. Comput., January, 1991

Finite-Automaton Aperiodicity is PSPACE-Complete.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Efficient Detectors and Constructors for Single Languages.

[BibT_eX]

[DOI]

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

The complexity of readiness and failure equivalences for processes.

[BibT_eX]

[DOI]

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

1990

The Complexity of Ranking Simple Languages.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1990

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

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1990

1988

On a Complexity Hierarchy Between L and NL.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

The complexity of ranking.

[BibT_eX]

[DOI]

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

1987

On Solving Hard Problems by Polynomial-Size Circuits.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

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

[BibT_eX]

[DOI]

John G. Geske

Alan L. Selman

Proceedings of the STACS 87, 1987

1986

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Some Observations about the Randomness of Hard Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

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

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

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

[BibT_eX]

[DOI]

Inf. Control., 1986

A Simple Proof for the Sum<sup>p</sup><sub>2</sub> Upper Bound of the Inequivalence Problem for Semilinear Sets.

[BibT_eX]

J. Inf. Process. Cybern., 1986

Resource- Bounded Kolmogorov Complexity of Hard Languages.

[BibT_eX]

[DOI]

Proceedings of the Structure in Complexity Theory, 1986

1985

The Complexity of Equivalence Problems for Commutative Grammars

[BibT_eX]

[DOI]

Inf. Control., 1985

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

[BibT_eX]

[DOI]

Acta Informatica, 1985

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

1983

Commutative Grammars: The Complexity of Uniform Word Problems

[BibT_eX]

[DOI]