Richard J. Lipton

According to our database1, Richard J. Lipton
  • authored at least 210 papers between 1974 and 2016.
  • has a "Dijkstra number"2 of two.

Awards

ACM Fellow

ACM Fellow 1997, "For sustained excellence in research in virtually every aspect of theoretical computer science. He has produced some of the most influential work in the field.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2016
Provably-Secure Remote Memory Attestation for Heap Overflow Protection.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Provably Secure Virus Detection: Using The Observer Effect Against Malware.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Provable Virus Detection: Using the Uncertainty Principle to Protect Against Malware.
IACR Cryptology ePrint Archive, 2015

Towards Provably-Secure Remote Memory Attestation.
IACR Cryptology ePrint Archive, 2015

2013
An Approximate Restatement of the Four-Color Theorem.
J. Graph Algorithms Appl., 2013

Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs.
Chicago J. Theor. Comput. Sci., 2013

Amplifying circuit lower bounds against polynomial time, with applications.
Computational Complexity, 2013

People, Problems, and Proofs - Essays from Gödel's Lost Letter: 2010.
Springer, ISBN: 978-3-642-41421-3, 2013

2012
Improved simulation of nondeterministic Turing machines.
Theor. Comput. Sci., 2012

Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs
CoRR, 2012

Simulating Special but Natural Quantum Circuits
CoRR, 2012

Might Turing Have Won a Turing Award?
IEEE Computer, 2012

Amplifying Circuit Lower Bounds against Polynomial Time with Applications.
Proceedings of the 27th Conference on Computational Complexity, 2012

2011
Best-order streaming model.
Theor. Comput. Sci., 2011

Quantum Complexity: Some Recent Results, Some Open Problems, Some Thoughts.
Proceedings of the Theory and Applications of Models of Computation, 2011

Symmetric Functions Capture General Functions.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Representative skylines using threshold-based preference distributions.
Proceedings of the 27th International Conference on Data Engineering, 2011

2010
Regret-Minimizing Representative Databases.
PVLDB, 2010

On Tractable Exponential Sums
CoRR, 2010

Improved Simulation of Nondeterministic Turing Machines.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

On Tractable Exponential Sums.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

Platform-independent programs.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

2009
Deterministically testing sparse polynomial identities of unbounded degree.
Inf. Process. Lett., 2009

On the Fourier spectrum of symmetric Boolean functions.
Combinatorica, 2009

Social Network Privacy via Evolving Access Control.
Proceedings of the Wireless Algorithms, 2009

Best-Order Streaming Model.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Algorithms for Message Ferrying on Mobile ad hoc Networks.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008
Polynomials that Sign Represent Parity and Descartes' Rule of Signs.
Computational Complexity, 2008

Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions.
Algorithmica, 2008

Algorithms for Modular Counting of Roots of Multivariate Polynomials.
Algorithmica, 2008

2007
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

2006
Symmetric polynomials over Zm and simultaneous communication protocols.
J. Comput. Syst. Sci., 2006

Perfectly Secure Password Protocols in the Bounded Retrieval Model.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Algorithms for Modular Counting of Roots of Multivariate Polynomials.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Towards the integration of diverse spam filtering techniques.
Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

2005
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms.
IEEE/ACM Trans. Netw., 2005

Estimating the maximum.
J. Algorithms, 2005

Time-space lower bounds for satisfiability.
J. ACM, 2005

Intrusion-Resilient Authentication in the Limited Communication Model.
IACR Cryptology ePrint Archive, 2005

Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Protecting Secret Data from Insider Attacks.
Proceedings of the Financial Cryptography and Data Security, 2005

On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas.
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004
The Degree of Threshold Mod 6 and Diophantine Equations
Electronic Colloquium on Computational Complexity (ECCC), 2004

On approximately fair allocations of indivisible goods.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Nash Equilibria via Polynomial Equations.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

On the Complexity of Hilbert's 17th Problem.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

Polynomials That Sign Represent Parity and Descartes Rule of Signs.
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2003
On the complexity of intersecting finite state automata and N L versus N P.
Theor. Comput. Sci., 2003

A Note on Square Rooting of Time Functions of Turing Machines.
Theory Comput. Syst., 2003

Symmetric Polynomials over Zm and Simultaneous Communication Protocols
Electronic Colloquium on Computational Complexity (ECCC), 2003

Deterministic identity testing for multivariate polynomials.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Playing large games using simple strategies.
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Who's The Weakest Link?
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2003

Mandatory human participation: a new authentication scheme for building secure systems.
Proceedings of the 12th International Conference on Computer Communications and Networks, 2003

Randomized Time-Space Tradeoffs for Directed Graph Connectivity.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Symmetric Polynomials over Zm and Simultaneous Communication Protocol.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Non-uniform Depth of Polynomial Time and Space Simulations.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002
Non-uniform Depth of Polynomial Time and Space Simulations
Electronic Colloquium on Computational Complexity (ECCC), 2002

Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory
CoRR, 2002

On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms.
Proceedings of the ACM SIGCOMM 2002 Conference on Applications, 2002

Gamma system: continuous evolution of software after deployment.
Proceedings of the International Symposium on Software Testing and Analysis, 2002

Spy: A Method to Secure Clients for Network Services.
Proceedings of the 22nd International Conference on Distributed Computing Systems, 2002

2001
On the Importance of Eliminating Errors in Cryptographic Computations.
J. Cryptology, 2001

Cheaper by the Dozen: Batched Algorithms.
Proceedings of the First SIAM International Conference on Data Mining, 2001

Defense Against Man-in-the-Middle Attack in Client-Server Systems.
Proceedings of the Sixth IEEE Symposium on Computers and Communications (ISCC 2001), 2001

2000
The Complexity of the A B C Problem.
SIAM J. Comput., 2000

Fidelity of Enzymatic Ligation for DNA Computing.
Journal of Computational Biology, 2000

On the Complexity of Intersecting Finite State Automata.
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

1999
On the Complexity of SAT.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

When the Knight falls: On constructing an RNA computer.
Proceedings of the DNA Based Computers, 1999

Computing from Partial Solutions.
Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998
Reconstructing Algebraic Functions from Mixed Data.
SIAM J. Comput., 1998

Micropayments via Efficient Coin-Flipping.
Proceedings of the Financial Cryptography, 1998

1997
DNA2DNA Computation: A Potential Killer Application?
Proceedings of the Advances in Neural Information Processing Systems 10, 1997

Effect of Operators on Straight Line Complexity.
Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

DNA²DNA Computations: A Potential "Killer App"?
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

On the Complexity of a Set-Union Problem.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract).
Proceedings of the Advances in Cryptology, 1997

DNA2DNA computations: A potential "killer app?".
Proceedings of the DNA Based Computers, 1997

1996
The Expressive Power of Multi-parent Creation in Monotonic Access Control Models.
Journal of Computer Security, 1996

On Proving that a Graph has no Large Clique: A Connection with Ramsey Theory.
Inf. Process. Lett., 1996

On the Computational Power of DNA.
Discrete Applied Mathematics, 1996

A Revocable Backup System.
Proceedings of the 6th USENIX Security Symposium, San Jose, CA, USA, July 22-25, 1996, 1996

DNA computations can have global memory.
Proceedings of the 1996 International Conference on Computer Design (ICCD '96), 1996

Clock Buffer Placement Algorithm for Wire-Delay-Dominated Timing Model.
Proceedings of the 6th Great Lakes Symposium on VLSI (GLS-VLSI '96), 1996

DNA computations can have global memory.
Proceedings of the DNA Based Computers, 1996

Making DNA computers error resistant.
Proceedings of the DNA Based Computers, 1996

Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract).
Proceedings of the Advances in Cryptology, 1996

1995
Query Size Estimation by Adaptive Sampling.
J. Comput. Syst. Sci., 1995

Communication Complexity of Key Agreement on Small Ranges.
STACS, 1995

Speeding up computations via molecular biology.
Proceedings of the DNA Based Computers, 1995

Breaking DES using a molecular computer.
Proceedings of the DNA Based Computers, 1995

Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract).
Proceedings of the Advances in Cryptology, 1995

1994
Subquadratic Simulations of Balanced Formulae by Branching Programs.
SIAM J. Comput., 1994

PSPACE Is Provable by Two Provers in One Round.
J. Comput. Syst. Sci., 1994

Simple strategies for large zero-sum games with applications to complexity theory.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

A New Approach To Information Theory.
Proceedings of the STACS 94, 1994

Online Interval Scheduling.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Some Consequences of Our Failure to Prove Non-Linear Lower Bounds on Explicit Functions.
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

Straight-line complexity and integer factorization.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993
Efficient Sampling Strategies for Relational Database Operations.
Theor. Comput. Sci., 1993

A Monte-Carlo Algorithm for Estimating the Permanent.
SIAM J. Comput., 1993

Clocked Adversaries for Hashing.
Algorithmica, 1993

Cryptographic Primitives Based on Hard Learning Problems.
Proceedings of the Advances in Cryptology, 1993

Amplification of Weak Learning under the Uniform Distribution.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

Towards Uncheatable benchmarks.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992
On Games of Incomplete Information.
Theor. Comput. Sci., 1992

How to Store a Triangular Matrix.
IEEE Trans. Computers, 1992

Probabilistic Dignosis of Hot Spots.
Proceedings of the Eighth International Conference on Data Engineering, 1992

Reconstructing Algebraic Functions from Mixed Data
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

The Expressive Power of Multi-Parent Creation in a Monotonic Access Control Model.
Proceedings of the 5th IEEE Computer Security Foundations Workshop, 1992

1991
Defining Software by Continuous, Smooth Functions.
IEEE Trans. Software Eng., 1991

A Class of Randomized Strategies for Low-Cost Comparison of File Copies.
IEEE Trans. Parallel Distrib. Syst., 1991

Set systems with no union of cardinality 0 modulom.
Graphs and Combinatorics, 1991

Self-Testing/Correcting for Polynomials and for Approximate Functions
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

PSPACE Is Provable By Two Provers In One Round.
Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

1990
The Processor Identity Problem.
Inf. Process. Lett., 1990

Efficient Checking of Computations.
Proceedings of the STACS 90, 1990

Playing Games of Incomplete Information.
Proceedings of the STACS 90, 1990

Practical Selectivity Estimation through Adaptive Sampling.
Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, 1990

Query Size Estimation by Adaptive Sampling.
Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1990

Uniform-Cost Communication in Scalable Multiprocessors.
Proceedings of the 1990 International Conference on Parallel Processing, 1990

On Bounded Round Multi-Prover Interactive Proof Systems.
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1989
Array Access Bounds for Block Storage Memory Systems.
IEEE Trans. Computers, 1989

Estimating the Size of Generalized Transitive Closures.
Proceedings of the Fifteenth International Conference on Very Large Data Bases, 1989

A Randomized Technique for Remote File Comparison.
Proceedings of the 9th International Conference on Distributed Computing Systems, 1989

On the Complexity of Space Bounded Interactive Proofs (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Subquadratic Simulations of Circuits by Branching Programs
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

New Directions In Testing.
Proceedings of the Distributed Computing And Cryptography, 1989

1986
Polynomial-time algorithm for the orbit problem.
J. ACM, 1986

Delta Transformations to Simplify VLSI Processor Arrays for Serial Dynamic Programming.
Proceedings of the International Conference on Parallel Processing, 1986

1985
Unbounded Fan-In Circuits and Associative Functions.
J. Comput. Syst. Sci., 1985

Pseudorandom Number Generation and Space Complexity
Information and Control, 1985

The Role Of Massive Memory In Knowledge-Base Management Systems.
On Knowledge Base Management Systems (Islamorada), 1985

A method for drawing graphs.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
A Massive Memory Machine.
IEEE Trans. Computers, 1984

Alternating Pushdown and Stack Automata.
SIAM J. Comput., 1984

Alternation Bounded Auxiliary Pushdown Automata
Information and Control, 1984

1983
VLSI Layout as Programming.
ACM Trans. Program. Lang. Syst., 1983

Multi-Party Protocols
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Unbounded Fan-in Circuits and Associative Functions
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Total Fault Testing Using the Bipartite Transformation.
Proceedings of the Proceedings International Test Conference 1983, 1983

Lower Bounds for Constant Depth Circuits for Prefix Problems.
Proceedings of the Automata, 1983

Pseudorandom Number Generation and Space Complexity.
Proceedings of the Fundamentals of Computation Theory, 1983

Total stuct-at-fault testing by circuit transformation.
Proceedings of the 20th Design Automation Conference, 1983

1982
Programming Aspects of VLSI.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

ALI: A procedural language to describe VLSI layouts.
Proceedings of the 19th Design Automation Conference, 1982

Design automation algorithms: Research and applications.
Proceedings of the 19th Design Automation Conference, 1982

1981
On the Structure of Sets in NP and Other Complexity Classes.
Theor. Comput. Sci., 1981

Covering Graphs by Simple Circuits.
SIAM J. Comput., 1981

Computing Extremal and Approximate Distances in Graphs Having Unit Cost Edges.
Acta Inf., 1981

Lower Bounds for VLSI
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

Multilevel Secure Distributed System.
Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981

Census Functions: an Approach to VLSI Upper Bounds (Preliminary Version)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
Applications of a Planar Separator Theorem.
SIAM J. Comput., 1980

Addition Chain Methods for the Evaluation of Specific Polynomials.
SIAM J. Comput., 1980

External Hashing Schemes for Collections of Data Structures.
J. ACM, 1980

Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem.
J. ACM, 1980

Some Connections between Nonuniform and Uniform Complexity Classes
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

The Orbit Problem is Decidable
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

The Consistency of "P = NP" and Related Problems with Fragments of Number Theory.
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

A System Architecture to Support a Verifiably Secure Multilevel Security System.
Proceedings of the 1980 IEEE Symposium on Security and Privacy, 1980

Protecting Shared Cryptographic Keys.
Proceedings of the 1980 IEEE Symposium on Security and Privacy, 1980

Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs.
Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

1979
Secure Databases: Protection Against User Influence.
ACM Trans. Database Syst., 1979

A Constructive Generalization of the Borel-Cantelli Lemma with Application to the Complexity of Infinite Strings.
Mathematical Systems Theory, 1979

On the Complexity of Computations under Varying Sets of Primitives.
J. Comput. Syst. Sci., 1979

Linear Programming is Log-Space Hard for P.
Inf. Process. Lett., 1979

Social Processes and Proofs of Theorems and Programs.
Commun. ACM, 1979

Some Connections between Mathematical Logic and Complexity Theory
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
Even Data Bases That Lie Can Be Compromised.
IEEE Trans. Software Eng., 1978

On Structure Preserving Reductions.
SIAM J. Comput., 1978

Polynomials with 0-1 Coefficients that Are Hard to Evaluate.
SIAM J. Comput., 1978

Evaluation of Polynomials with Super-Preconditioning.
J. Comput. Syst. Sci., 1978

The Enforcement of Security Policies for Computation.
J. Comput. Syst. Sci., 1978

A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem.
J. Comput. Syst. Sci., 1978

A Batching Method for Coloring Planar Graphs.
Inf. Process. Lett., 1978

A Probabilistic Remark on Algebraic Program Testing.
Inf. Process. Lett., 1978

Hints on Test Data Selection: Help for the Practicing Programmer.
IEEE Computer, 1978

Preserving Average Proximity in Arrays.
Commun. ACM, 1978

Model Theoretic Aspects of Computational Complexity
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

Alternating Pushdown Automata (Preliminary Report)
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977
Synchronization and Computing Capabilities of Linear Asynchronous Structures.
J. Comput. Syst. Sci., 1977

Word Problems Solvable in Logspace.
J. ACM, 1977

A Linear Time Algorithm for Deciding Subject Security.
J. ACM, 1977

Social Processes and Proofs of Theorems and Programs.
Proceedings of the Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, 1977

Application of a Planar Separator Theorem
Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

A Necessary and Sufficient Condition for the Existence of Hoare Logics
Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976
Complexity Measures and Hierarchies for the Evaluation of Integers and Polynomials.
Theor. Comput. Sci., 1976

Multidimensional Searching Problems.
SIAM J. Comput., 1976

Space and Time Hierarchies for Classes of Control Structures and Data Structures.
J. ACM, 1976

Evaluation of Polynomials with Super-Preconditioning
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

A Linear Time Algorithm for Deciding Security
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975
A Synchronization Anomaly.
Inf. Process. Lett., 1975

Reduction: A Method of Proving Properties of Parallel Programs.
Commun. ACM, 1975

The Complexity of Control Structures and Data Structures
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

The Enforcement of Security Policies for Computation.
Proceedings of the Fifth Symposium on Operating System Principles, 1975

Reduction: A New Method of Proving Properties of Systems of Processes.
Proceedings of the Conference Record of the Second ACM Symposium on Principles of Programming Languages, 1975

Synchronization and Computing Capabilities of Linear Asynchronous Structures
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

Polynomials with 0-1 Coefficients that Are Hard to Evaluate
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

On the complexity of computations under varying sets of primitives.
Proceedings of the Automata Theory and Formal Languages, 1975

1974
Limitations of Synchronization Primitives with Conditional Branching and Global Variables
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

On Some Generalizations of Binary Search
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

Schedulers as enforces in synchronization.
Proceedings of the Operating Systems, 1974

A Comparative Study of Models of Parallel Computation
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974


  Loading...