Ronald L. Graham

J. Sched., October, 2025

2022

Guessing about Guessing: Practical Strategies for Card Guessing with Feedback.

[BibT_eX]

[DOI]

Sam Spiro

Am. Math. Mon., 2022

Card guessing with partial feedback.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2022

2021

Permanental generating functions and sequential importance sampling.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2021

2020

Efficient Packings of Unit Squares in a Large Square.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

2019

Three-dimensional Floorplan Representations by Using Corner Links and Partial Order.

[BibT_eX]

[DOI]

ACM Trans. Design Autom. Electr. Syst., 2019

2018

Maximally Nontransitive Dice.

[BibT_eX]

[DOI]

Joe Buhler

Alfred W. Hales

Am. Math. Mon., 2018

Sum sequences modulo n.

[BibT_eX]

[DOI]

Jon Folkman

J. Comb. Theory A, 2018

Tree Structures and Algorithms for Physical Design.

[BibT_eX]

[DOI]

Proceedings of the 2018 International Symposium on Physical Design, 2018

2017

The drop polynomial of a weighted digraph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Parking distributions on trees.

[BibT_eX]

[DOI]

Catherine H. Yan

Eur. J. Comb., 2017

2016

Inserting Plus Signs and Adding.

[BibT_eX]

[DOI]

Richard Stong

Am. Math. Mon., 2016

The Mathematics of the Flip and Horseshoe Shuffles.

[BibT_eX]

[DOI]

Am. Math. Mon., 2016

Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions.

[BibT_eX]

[DOI]

Oliver Braun

OR Spectr., 2016

3D floorplan representations: Corner links and partial order.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International 3D Systems Integration Conference, 2016

2015

Egyptian Fractions with Each Denominator Having Three Distinct Prime Divisors.

[BibT_eX]

[DOI]

Integers, 2015

Partition and sum is fast.

[BibT_eX]

[DOI]

Richard Stong

CoRR, 2015

Edge flipping in the complete graph.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2015

2014

Single-processor scheduling with time restrictions.

[BibT_eX]

[DOI]

Oliver Braun

Fan Chung Graham

J. Sched., 2014

De Bruijn Sequences with Varying Combs.

[BibT_eX]

[DOI]

Abbas Alhakim

Integers, 2014

Unseparated pairs and fixed points in random permutations.

[BibT_eX]

[DOI]

Steven N. Evans

Adv. Appl. Math., 2014

2013

Subdivision Using Angle Bisectors Is Dense in the Space of Triangles.

[BibT_eX]

[DOI]

Am. Math. Mon., 2013

Inversion-descent polynomials for restricted permutations.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

Constructing Points through Folding and Intersection.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2013

Anarchy Is Free in Network Creation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 10th International Workshop, 2013

Ramsey Theory in the Work of Paul Erdős.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

A note on marking lines in [k] n - In honor of Rick Wilson's 65th birthday.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2012

Edge flipping in graphs.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2012

Character design and stamp algorithms for Character Projection Electron-Beam Lithography.

[BibT_eX]

[DOI]

Proceedings of the 17th Asia and South Pacific Design Automation Conference, 2012

2011

Bus Matrix Synthesis Based on Steiner Graphs for Power Efficient System-on-Chip Communications.

[BibT_eX]

[DOI]

Renshen Wang

Yulei Zhang

Nan-Chi Chou

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

Hypercube orientations with only two in-degrees.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

2010

Some Ramsey-type results for the n-cube.

[BibT_eX]

[DOI]

József Solymosi

J. Comb. Theory A, 2010

Finding Patterns Avoiding Many Monochromatic Constellations.

[BibT_eX]

[DOI]

Kevin P. Costello

Exp. Math., 2010

Descent polynomials for permutations with bounded drop size.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

How to play the Majority game with a liar.

[BibT_eX]

[DOI]

Jia Mao

Discret. Math., 2010

Irreducible Apollonian Configurations and Packings.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Tiling Polygons with Lattice Triangles.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Physical synthesis of bus matrix for high bandwidth low power on-chip communications.

[BibT_eX]

[DOI]

Renshen Wang

Proceedings of the 2010 International Symposium on Physical Design, 2010

2009

Approximately optimal trees for group key management with batch updates.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Packing equal squares into a large square.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2009

Minimum perimeter rectangles that enclose congruent non-overlapping circles.

[BibT_eX]

[DOI]

Discret. Math., 2009

Bubblesort and Juggling Sequences.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Primitive Juggling Sequences.

[BibT_eX]

[DOI]

Am. Math. Mon., 2008

Erratum: Quasi-random graphs with given degree sequences.

[BibT_eX]

[DOI]

Fan Chung Graham

Random Struct. Algorithms, 2008

Quasi-random graphs with given degree sequences.

[BibT_eX]

[DOI]

Fan Chung Graham

Random Struct. Algorithms, 2008

Enumerating split-pair arrangements.

[BibT_eX]

[DOI]

Nan Zang

J. Comb. Theory A, 2008

Analysis of greedy approximations with nonsubmodular potential functions.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

3-D floorplanning using labeled tree and dual sequences.

[BibT_eX]

[DOI]

Renshen Wang

Proceedings of the 2008 International Symposium on Physical Design, 2008

2007

Optimal Tree Structures for Group Key Management with Batch Updates.

[BibT_eX]

[DOI]

Minming Li

Frances F. Yao

SIAM J. Discret. Math., 2007

Approximately Optimal Trees for Group Key Management with Batch Updates.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

How to Play the Majority Game with Liars.

[BibT_eX]

[DOI]

Jia Mao

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

On the construction of zero-deficiency parallel prefix circuits with minimum depth.

[BibT_eX]

[DOI]

Haikun Zhu

ACM Trans. Design Autom. Electr. Syst., 2006

Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

Maximizing data locality in distributed systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Apollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

Timing model reduction for hierarchical timing analysis.

[BibT_eX]

[DOI]

Proceedings of the 2006 International Conference on Computer-Aided Design, 2006

Communication latency aware low power NoC synthesis.

[BibT_eX]

[DOI]

Proceedings of the 43rd Design Automation Conference, 2006

2005

Apollonian Circle Packings: Geometry and Group Theory I. The Apollonian Group.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

Oblivious and Adaptive Strategies for the Majority and Plurality Problems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Constructing zero-deficiency parallel prefix adder of minimum depth.

[BibT_eX]

[DOI]

Haikun Zhu

Proceedings of the 2005 Conference on Asia South Pacific Design Automation, 2005

2004

Euclidean Ramsey Theory.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Parallelism versus memory allocation in pipelined router forwarding engines.

[BibT_eX]

[DOI]

George Varghese

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

2003

Floorplan representations: Complexity and connections.

[BibT_eX]

[DOI]

ACM Trans. Design Autom. Electr. Syst., 2003

Finding Favorites

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

A hierarchical three-way interconnect architecture for hexagonal processors.

[BibT_eX]

[DOI]

Proceedings of the 5th International Workshop on System-Level Interconnect Prediction (SLIP 2003), 2003

2002

Ramsey Properties of Families of Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

New bounds on a hypercube coloring problem.

[BibT_eX]

[DOI]

Hung Q. Ngo

Inf. Process. Lett., 2002

Sparse Quasi-Random Graphs.

[BibT_eX]

[DOI]

Comb., 2002

Guessing secrets with inner product questions.

[BibT_eX]

[DOI]

Linyuan Lu

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Balancing the Interconnect Topology for Arrays of Processors between Cost and Power.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Computer Design (ICCD 2002), 2002

2001

Dynamic location problems with limited look-ahead .

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Distance Realization Problems with Applications to Internet Tomography.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

On Bipartite Graphs with Linear Ramsey Numbers.

[BibT_eX]

[DOI]

Andrzej Rucinski

Comb., 2001

Combinatorics for the East Model.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2001

Guessing secrets.

[BibT_eX]

[DOI]

Frank Thomson Leighton

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

New Bounds on a Hypercube Coloring Problem and Linear Codes.

[BibT_eX]

[DOI]

Hung Quang Ngo

Proceedings of the 2001 International Symposium on Information Technology (ITCC 2001), 2001

Revisiting floorplan representations.

[BibT_eX]

[DOI]

Proceedings of the 2001 International Symposium on Physical Design, 2001

2000

On graphs with linear Ramsey numbers.

[BibT_eX]

[DOI]

Andrzej Rucinski

J. Graph Theory, 2000

Improving Dense Packings of Equal Disks in a Square.

[BibT_eX]

[DOI]

Electron. J. Comb., 2000

1998

Dense packings of congruent circles in a circle.

[BibT_eX]

[DOI]

Kari J. Nurmela

Patric R. J. Östergård

Discret. Math., 1998

Forced Convex n -Gons in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

Combinatorial Problems Arising in Massive Data Sets (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Stratified random walks on the n-cube.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

The Steiner ratio for the dual normed plane.

[BibT_eX]

[DOI]

Peng-Jun Wan

Discret. Math., 1997

Curved Hexagonal Packings of Equal Disks in a Circle.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1997

Random walks on generating sets for finite groups.

[BibT_eX]

[DOI]

Electron. J. Comb., 1997

1996

On sampling with Markov chains.

[BibT_eX]

[DOI]

Shing-Tung Yau

Random Struct. Algorithms, 1996

Repeated Patterns of Dense Packings of Equal Disks in a Square.

[BibT_eX]

[DOI]

Electron. J. Comb., 1996

1995

On the Cover Polynomial of a Digraph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Dense Packings of Equal Disks in an Equilateral Triangle: from 22 to 34 and Beyond.

[BibT_eX]

[DOI]

Electron. J. Comb., 1995

Dense Packings of 3k(k+1)+1 Equal Disks in a Circle for k=1, 2, 3, 4 and 5.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

A Note on the Binomial Drop Polynomial of a Poset.

[BibT_eX]

Joe Buhler

J. Comb. Theory A, 1994

Recent trends in Euclidean Ramsey theory.

[BibT_eX]

[DOI]

Discret. Math., 1994

Quasi-Random Combinatorial Structures (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

The Tight Lower Bound for the Steiner Ratio in Minkowski Planes.

[BibT_eX]

[DOI]

Biao Gao

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Concrete mathematics - a foundation for computer science (2. ed.).

[BibT_eX]

Oren Patashnik

Addison-Wesley, ISBN: 978-0-201-55802-9, 1994

Concrete Mathematics: A Foundation for Computer Science, 2nd Ed.

[BibT_eX]

[DOI]

Oren Patashnik

Addison-Wesley, ISBN: 0-201-55802-5, 1994

1993

Lexicographic Ramsey Theory.

[BibT_eX]

Peter C. Fishburn

J. Comb. Theory A, 1993

On hypergraphs having evenly distributed subhypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

Minimum Steiner Trees in Normed Planes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1993

Routing permutations on graphs via matchings.

[BibT_eX]

[DOI]

Noga Alon

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

Quasi-Random Subsets of Integern.

[BibT_eX]

J. Comb. Theory A, 1992

Binomial coefficient codes over GF(2).

[BibT_eX]

[DOI]

Discret. Math., 1992

Universal cycles for combinatorial structures.

[BibT_eX]

[DOI]

Discret. Math., 1992

Bounds for arrays of dots with distinct slopes or lengths.

[BibT_eX]

[DOI]

Comb., 1992

1991

Quasi-random tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 1991

1990

Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions.

[BibT_eX]

[DOI]

John A. Morrison

Random Struct. Algorithms, 1990

Quasi-Random Hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

Iterated combinatorial density theorems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1990

Penny-Packing and Two-Dimensional Codes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1990

1989

Maximal antiramsey graphs and the strong chromatic number.

[BibT_eX]

[DOI]

J. Graph Theory, 1989

Quasi-random graphs.

[BibT_eX]

[DOI]

Richard M. Wilson

Comb., 1989

A dynamic location problem for graphs.

[BibT_eX]

[DOI]

Michael E. Saks

Comb., 1989

On the Improbability of Reaching Byzantine Agreements (Preliminary Version)

[BibT_eX]

[DOI]

Andrew Chi-Chih Yao

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Concrete mathematics - a foundation for computer science.

[BibT_eX]

Oren Patashnik

Addison-Wesley, ISBN: 978-0-201-14236-5, 1989

1988

On the Fractional Covering Number of Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

Pursuit - Evasion games on graphs.

[BibT_eX]

[DOI]

Joel E. Cohen

J. Graph Theory, 1988

Quantitative theorems for regular systems of equations.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1988

On induced subgraphs of the cube.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1988

1987

Highly irregular graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1987

Induced restricted Ramsey theorems for spaces.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1987

On subsets of abelian groups with no 3-term arithmetic progression.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1987

The Radon transform on Abelian Groups.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1987

1986

Large minimal sets which force long arithmetic progressions.

[BibT_eX]

[DOI]

Jaroslav Nesetril

J. Comb. Theory A, 1986

Some intersection theorems for ordered sets and graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

1985

On the covering radius of codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1985

Classes of interval graphs under expanding length restrictions.

[BibT_eX]

[DOI]

Peter C. Fishburn

J. Graph Theory, 1985

Quantitative Forms of a Theorem of Hilbert.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1985

On the addressing problem for directed graphs.

[BibT_eX]

[DOI]

Peter M. Winkler

Graphs Comb., 1985

Intersection Theorems for Vector Spaces.

[BibT_eX]

[DOI]

Eur. J. Comb., 1985

On the History of the Minimum Spanning Tree Problem.

[BibT_eX]

[DOI]

Pavol Hell

IEEE Ann. Hist. Comput., 1985

1983

Euclidean Ramsey theorems on the n-sphere.

[BibT_eX]

[DOI]

J. Graph Theory, 1983

A Canonical Partition Theorem for Equivalence Relations on Zt.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1983

Finding the Convex Hull of a Simple Polygon.

[BibT_eX]

[DOI]

J. Algorithms, 1983

Edge-colored complete graphs with precisely colored subgraphs.

[BibT_eX]

[DOI]

Comb., 1983

1982

Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1982

Applications of the FKG Inequality and Its Relatives.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Programming The State of the Art, 1982

1981

Homogeneous Collinear Sets in Partitions of Zn.

[BibT_eX]

[DOI]

Wen-Ching Winnie Li

Jerome L. Paul

J. Comb. Theory A, 1981

Universal caterpillars.

[BibT_eX]

[DOI]

James B. Shearer

J. Comb. Theory B, 1981

Minimal decompositions of graphs into mutually isomorphic subgraphs.

[BibT_eX]

[DOI]

Comb., 1981

1980

Lower bounds for constant weight codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1980

Some Monotonicity Properties of Partial Orders.

[BibT_eX]

[DOI]

Andrew C. Yao

SIAM J. Algebraic Discret. Methods, 1980

On Additive Bases and Harmonious Graphs.

[BibT_eX]

[DOI]

SIAM J. Algebraic Discret. Methods, 1980

On the Structure of t-Designs.

[BibT_eX]

[DOI]

Shuo-Yen Robert Li

Wen-Ching Winnie Li

SIAM J. Algebraic Discret. Methods, 1980

On Unimodality for Linear Extensions of Partial Orders.

[BibT_eX]

[DOI]

F. R. K. Chung

Peter C. Fishburn

SIAM J. Algebraic Discret. Methods, 1980

A Note on the Intersection Properties of Subsets of Integers.

[BibT_eX]

[DOI]

Miklós Simonovits

Vera T. Sós

J. Comb. Theory A, 1980

On Partitions of En.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1980

Information Bounds Are Weak in the Shortest Distance Problem.

[BibT_eX]

[DOI]

Andrew Chi-Chih Yao

J. ACM, 1980

On a Diophantine Equation Arising in Graph Theory.

[BibT_eX]

[DOI]

Eur. J. Comb., 1980

1979

Combinatorial designs related to the strong perfect graph conjecture.

[BibT_eX]

[DOI]

Discret. Math., 1979

1978

On subgraph number independence in trees.

[BibT_eX]

[DOI]

Endre Szemerédi

J. Comb. Theory B, 1978

The Number of Baxter Permutations.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1978

On graphs which contain all small trees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1978

Performance Guarantees for Scheduling Algorithms.

[BibT_eX]

[DOI]

David S. Johnson

Oper. Res., 1978

Addition chains with multiplicative cost.

[BibT_eX]

[DOI]

Andrew Chi-Chih Yao

Discret. Math., 1978

1977

On the distance matrix of a directed graph.

[BibT_eX]

[DOI]

Alan J. Hoffman

H. Hosoya

J. Graph Theory, 1977

1976

Resource Constrained Scheduling as Generalized Bin Packing.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1976

On the distance matrix of a tree.

[BibT_eX]

[DOI]

M. Edelberg

Discret. Math., 1976

Some NP-Complete Geometric Problems

[BibT_eX]

[DOI]

David S. Johnson

Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

1975

Bounds for Multiprocessor Scheduling with Resource Constraints.

[BibT_eX]

[DOI]

SIAM J. Comput., 1975

The Largest Small Hexagon.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1975

On Packing Squares with Equal Squares.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1975

1974

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1974

Problem #7.

[BibT_eX]

[DOI]

Stephen C. Johnson

SIGSAM Bull., 1974

Performance Bounds on the Splitting Algorithm for Binary Testing.

[BibT_eX]

[DOI]

Acta Informatica, 1974

1973

Covering the Positive Integers by Disjoint Sets of the Form {[n alpha + beta]: n = 1, 2, ...}.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1973

Euclidean Ramsey Theorems I.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1973

Bounds on Scheduling with Limited Resources.

[BibT_eX]

[DOI]

Proceedings of the Fourth Symposium on Operating System Principles, 1973

1972

An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1972

Complements and transitive closures.

[BibT_eX]

[DOI]

Theodore S. Motzkin

Discret. Math., 1972

Optimal Scheduling for Two-Processor Systems.

[BibT_eX]

[DOI]

Edward G. Coffman Jr.

Acta Informatica, 1972

Worst-Case Analysis of Memory Allocation Algorithms

[BibT_eX]

[DOI]

Jeffrey D. Ullman

Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

Bounds on multiprocessing anomalies and related packing algorithms.

[BibT_eX]

[DOI]

Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1972 Spring Joint Computer Conference, 1972

1969

Universal Single Transition Time Asynchronous State Assignments.

[BibT_eX]

[DOI]

Arthur D. Friedman

Jeffrey D. Ullman

IEEE Trans. Computers, 1969

Bounds on Multiprocessing Timing Anomalies.

[BibT_eX]

SIAM Journal of Applied Mathematics, 1969

1968

An Upper Bound on Minimum Distance for a k-ary Code

[BibT_eX]

[DOI]

Aaron D. Wyner

Inf. Control., July, 1968

On Finite 0-Simple Semigroups and Graph Theory.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1968

1967

On n-Valued Functionally Complete Truth Functions.

[BibT_eX]

[DOI]