Dana S. Richards

Proceedings of the Security, Steganography, and Watermarking of Multimedia Contents VIII, 2006

Towards Lower Bounds on Embedding Distortion in Information Hiding.

[BibT_eX]

[DOI]

Proceedings of the Digital Watermarking, 5th International Workshop, 2006

Modified Matrix Encoding Technique for Minimal Distortion Steganography.

[BibT_eX]

[DOI]

Proceedings of the Information Hiding, 8th International Workshop, 2006

2005

Minimizing the Statistical Impact of LSB Steganography.

[BibT_eX]

[DOI]

Proceedings of the Image Analysis and Recognition, Second International Conference, 2005

2002

Logic and language models for computer science.

[BibT_eX]

[DOI]

Henry Hamburger

SIGACT News, 2002

2000

NSF Report: Theory of Computing Program.

[BibT_eX]

[DOI]

SIGACT News, 2000

Multi-Source Spanning Tree Problems.

[BibT_eX]

[DOI]

Arthur M. Farley

Paraskevi Fragopoulou

David W. Krumme

Andrzej Proskurowski

J. Interconnect. Networks, 2000

1999

Mixed Spanning Trees in Theory and Practice.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1999

1995

Tree Open Ear Decomposition in Parallel Graph Algorithms.

[BibT_eX]

[DOI]

Louis Ibarra

Parallel Process. Lett., 1995

Degree-Constrained Pyramid Spanners.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1995

1994

Reliable broadcasting.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

Network Communication in Edge-Colored Graphs: Gossiping.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1993

Perpetual Gossiping.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1993

Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.

[BibT_eX]

[DOI]

Louis Ibarra

Parallel Comput., 1993

An Introduction to Perpetual Gossiping.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Mixed spanning trees: a technique for performance-driven routing.

[BibT_eX]

[DOI]

Dallas E. Wrege

Proceedings of the Third Great Lakes Symposium on Design Automation of High Performance VLSI Systems, 1993

1992

Steiner tree problems.

[BibT_eX]

[DOI]

Frank K. Hwang

Networks, 1992

Studies of self-organizing placement algorithms for linear and finger lists.

[BibT_eX]

[DOI]

Inf. Sci., 1992

A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets.

[BibT_eX]

[DOI]

Algorithmica, 1992

Stacks, Queues, and Deques with Order-Statistic Operations.

[BibT_eX]

[DOI]

Acta Informatica, 1992

1991

Distributed genetic algorithms for the floorplan design problem.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1991

A platform for biological sequence comparison on parallel computers.

[BibT_eX]

[DOI]

A. S. Deshpande

William R. Pearson

Comput. Appl. Biosci., 1991

A simple proof of Hwang's theorem for rectilinear Steiner minimal trees.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1991

A Multi-Population Genetic Algorithm for Solving the K-Partition Problem on Hyper-Cubes.

[BibT_eX]

Worthy N. Martin

Proceedings of the 4th International Conference on Genetic Algorithms, 1991

1990

VLSI median filters.

[BibT_eX]

[DOI]

IEEE Trans. Acoust. Speech Signal Process., 1990

An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990

Efficient algorithms for path partitions.

[BibT_eX]

[DOI]

Craig Williams

Discret. Appl. Math., 1990

A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets.

[BibT_eX]

[DOI]

Proceedings of the SWAT 90, 1990

Genetic Algorithms and Punctuated Equilibria in VLSI.

[BibT_eX]

[DOI]

Worthy N. Martin

Proceedings of the Parallel Problem Solving from Nature, 1st Workshop, 1990

1989

On the Inference of Strategies.

[BibT_eX]

[DOI]

Charles Swart

Theor. Comput. Sci., 1989

Fast Heuristic Algorithms for Rectilinear Steiner Trees.

[BibT_eX]

[DOI]

Algorithmica, 1989

1988

Generalizations of broadcasting and gossiping.

[BibT_eX]

[DOI]

Networks, 1988

Optimal two-terminal α-β wire routing.

[BibT_eX]

[DOI]

Integr., 1988

On the Distribution of Comparisons in Sorting Algorithms.

[BibT_eX]

[DOI]

Pravin M. Vaidya

BIT, 1988

A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle.

[BibT_eX]

[DOI]

Proceedings of the 1988 IEEE International Conference on Computer-Aided Design, 1988

Floorplan design using distributed genetic algorithms.

[BibT_eX]

[DOI]

Proceedings of the 1988 IEEE International Conference on Computer-Aided Design, 1988

1987

Punctuated Equilibria: A Parallel Genetic Algorithm.

[BibT_eX]

Proceedings of the 2nd International Conference on Genetic Algorithms, 1987

1986

Finding Short Cycles in Planar Graphs Using Separators.

[BibT_eX]

[DOI]

J. Algorithms, 1986

Data Compression and Gray-Code Sorting.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

1984

Problems in Sorting and Graph Algorithms

[BibT_eX]

[DOI]

PhD thesis, 1984

Complexity of Single-Layer Routing.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1984

Toward optimal gossiping schemes with conference calls.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1984

1982

Note about: "On the file update problem".

[BibT_eX]

[DOI]

ACM SIGCSE Bull., 1982

1981

On the file update problems.

[BibT_eX]

[DOI]

ACM SIGCSE Bull., 1981

1980

On a "Counter - Example".

[BibT_eX]

[DOI]

SIGARCH Comput. Archit. News, 1980

1979

On a Theorem of Chorneyko and Mohanty.

[BibT_eX]

[DOI]