Uzi Vishkin

CoRR, 2023

Empirical Challenge for NC Theory (Abstract).

[BibT_eX]

[DOI]

Ananth Hari

Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

2022

On the model of computation: counterpoint.

[BibT_eX]

[DOI]

Commun. ACM, 2022

ImmunoTyper-SR: A Novel Computational Approach for Genotyping Immunoglobulin Heavy Chain Variable Genes Using Short Read Data.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2022

Beyond worst-case analysis: observed low depth for a P-complete problem.

[BibT_eX]

[DOI]

Proceedings of the PMAM@PPoPP 2022: Proceedings of the Thirteenth International Workshop on Programming Models and Applications for Multicores and Manycores, Virtual Event / Seoul, Republic of Korea, April 2, 2022

2021

Study of Fine-grained Nested Parallelism in CDCL SAT Solvers.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2021

SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2019

Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness.

[BibT_eX]

[DOI]

Dana Dachman-Soled

Chang Liu

Charalampos Papamanthou

Elaine Shi

J. Cryptol., 2019

2018

Easy PRAM-Based High-Performance Parallel Programming with ICE.

[BibT_eX]

[DOI]

Fady Ghanim

Rajeev Barua

IEEE Trans. Parallel Distributed Syst., 2018

Linking parallel algorithmic thinking to many-core memory systems and speedups for boosted decision trees.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Memory Systems, 2018

2016

FFT on XMT: Case Study of a Bandwidth-Intensive Regular Algorithm on a Highly-Parallel Many Core.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016

POSTER: Easy PRAM-based High-Performance Parallel Programming with ICE.

[BibT_eX]

[DOI]

Fady Ghanim

Rajeev Barua

Proceedings of the 2016 International Conference on Parallel Architectures and Compilation, 2016

2015

Oblivious Network RAM.

[BibT_eX]

[DOI]

Dana Dachman-Soled

Chang Liu

Charalampos Papamanthou

Elaine Shi

IACR Cryptol. ePrint Arch., 2015

2014

Lazy Scheduling: A Runtime Adaptive Scheduler for Declarative Parallelism.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2014

Parallel algorithms for Burrows-Wheeler compression and decompression.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Is multicore hardware for general-purpose parallel processing broken?

[BibT_eX]

[DOI]

Commun. ACM, 2014

2013

Brief announcement: truly parallel burrows-wheeler compression and decompression.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

2012

Brief announcement: speedups for parallel graph triconnectivity.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Better speedups using simpler parallel programming for graph connectivity and biconnectivity.

[BibT_eX]

[DOI]

Proceedings of the 2012 PPOPP International Workshop on Programming Models and Applications for Multicores and Manycores, 2012

2011

A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors.

[BibT_eX]

[DOI]

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

Resource-Aware Compiler Prefetching for Fine-Grained Many-Cores.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 2011

Using simple abstraction to reinvent computing for parallelism.

[BibT_eX]

[DOI]

George Constantin Caragea

Commun. ACM, 2011

Brief announcement: better speedups for parallel max-flow.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Panel Statement.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Toolchain for Programming, Simulating and Studying the XMT Many-Core Architecture.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Power-Performance Comparison of Single-Task Driven Many-Cores.

[BibT_eX]

[DOI]

Fuat Keceli

Tali Moreshet

Proceedings of the 17th IEEE International Conference on Parallel and Distributed Systems, 2011

Improving Run-Time Scheduling for General-Purpose Parallel Code.

[BibT_eX]

[DOI]

Alexandros Tzannes

Rajeev Barua

Proceedings of the 2011 International Conference on Parallel Architectures and Compilation Techniques, 2011

2010

Is teaching parallel algorithmic thinking to high school students possible?: one teacher's experience.

[BibT_eX]

[DOI]

Proceedings of the 41st ACM technical symposium on Computer science education, 2010

Lazy binary-splitting: a run-time adaptive work-stealing scheduler.

[BibT_eX]

[DOI]

Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2010

Resource-Aware Compiler Prefetching for Many-Cores.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Symposium on Parallel and Distributed Computing, 2010

Thermal Management of a Many-Core Processor under Fine-Grained Parallelism.

[BibT_eX]

[DOI]

Fuat Keceli

Tali Moreshet

Proceedings of the Euro-Par 2011: Parallel Processing Workshops - CCPI, CGWS, HeteroPar, HiBB, HPCVirt, HPPC, HPSS, MDGS, ProPer, Resilience, UCHPC, VHPC, Bordeaux, France, August 29, 2010

2009

Mesh-of-Trees and Alternative Interconnection Networks for Single-Chip Parallelism.

[BibT_eX]

[DOI]

IEEE Trans. Very Large Scale Integr. Syst., 2009

Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Algorithmic approach to designing an easy-to-program system: Can it lead to a HW-enhanced programmer's workflow add-on?

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Computer Design, 2009

HPPC 2009 Panel: Are Many-Core Computer Vendors on Track?

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2009, 2009

2008

A pilot study to compare programming effort for two parallel programming models.

[BibT_eX]

[DOI]

J. Syst. Softw., 2008

XMT-GPU: A PRAM Architecture for Graphics Computation.

[BibT_eX]

[DOI]

Proceedings of the 2008 International Conference on Parallel Processing, 2008

An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing.

[BibT_eX]

[DOI]

Proceedings of the 45th Design Automation Conference, 2008

Fpga-based prototype of a pram-on-chip processor.

[BibT_eX]

[DOI]

Xingzhi Wen

Proceedings of the 5th Conference on Computing Frontiers, 2008

2007

Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform.

[BibT_eX]

[DOI]

Bryant C. Lee

George C. Caragea

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

PRAM-on-chip: first commitment to silicon.

[BibT_eX]

[DOI]

Xingzhi Wen

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Layout-Accurate Design and Implementation of a High-Throughput Interconnection Network for Single-Chip Parallel Processing.

[BibT_eX]

[DOI]

Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects, 2007

Toward Realizing a PRAM-on-a-Chip Vision.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2007 Workshops: Parallel Processing, 2007

2006

Bootstrapping Free-Space Optical Networks.

[BibT_eX]

[DOI]

Fang Liu

Stuart D. Milner

IEEE J. Sel. Areas Commun., 2006

Case study of gate-level logic simulation on an extremely fine-grained chip multiprocessor.

[BibT_eX]

[DOI]

Pei Gu

J. Embed. Comput., 2006

A bootstrapping model for directional wireless networks.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2006

A Mesh-of-Trees Interconnection Network for Single-Chip Parallel Processing.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE International Conference on Application-Specific Systems, 2006

2004

PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Arbitrate-and-move primitives for high throughput on-chip interconnection networks.

[BibT_eX]

Proceedings of the 2004 International Symposium on Circuits and Systems, 2004

2003

Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2003

Deterministic Resource Discovery in Distributed Networks.

[BibT_eX]

[DOI]

Shay Kutten

David Peleg

Theory Comput. Syst., 2003

2002

Two techniques for reconciling algorithm parallelism with memory constraints.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

2001

Evaluating the XMT Parallel Programming Model.

[BibT_eX]

[DOI]

Proceedings of the High-Level Parallel Programming Models and Supportive Environments, 2001

What to Do with All this Hardware? (Invited Lecture).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000

Experiments With List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism.

[BibT_eX]

[DOI]

Shlomit Dascal

ACM J. Exp. Algorithmics, 2000

A PRAM-on-Chip Vision (invited abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

A no-busy-wait balanced tree parallel algorithmic paradigm.

[BibT_eX]

[DOI]

Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

Communication complexity of document exchange.

[BibT_eX]

[DOI]

Graham Cormode

Mike Paterson

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Trade-offs between Communication Throughput and Parallel Time.

[BibT_eX]

[DOI]

Yishay Mansour

Noam Nisan

J. Complex., 1999

1998

Explicit Multi-Threading (XMT) Bridging Models for Instruction Parallelism (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

1997

From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum.

[BibT_eX]

[DOI]

Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

Conflict-Free Access to Multiple Single-Ported Register Files.

[BibT_eX]

[DOI]

Silvia M. Müller

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Approximate string searching.

[BibT_eX]

Proceedings of the Pattern Matching Algorithms, 1997

1996

Sorting Strings and Constructing Digital Search Trees in Parallel.

[BibT_eX]

[DOI]

Joseph F. JáJá

Kwan Woo Ryu

Theor. Comput. Sci., 1996

A fast parallel algorithm for finding the convex hull of a sorted point set.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1996

Can Parallel Algorithms Enhance Seriel Implementation?

[BibT_eX]

[DOI]

Commun. ACM, 1996

Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Almost Fully-parallel Parentheses Matching.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

Parallel algorithms for database operations and a database operation for parallel algorithms.

[BibT_eX]

[DOI]

Rajeev Raman

Proceedings of IPPS '95, 1995

A note on reducing parallel model simulations to integer sorting.

[BibT_eX]

[DOI]

Proceedings of IPPS '95, 1995

On a Technique for Parsing a String (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1994

Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima.

[BibT_eX]

[DOI]

Joseph F. JáJá

Sridhar Krishnamurthy

Ramakrishna Thurimella

SIAM J. Comput., 1994

Finding Level-Ancestors in Trees.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers.

[BibT_eX]

[DOI]

Neal E. Young

J. Algorithms, 1994

Biconnectivity Approximations and Graph Carvings.

[BibT_eX]

[DOI]

J. ACM, 1994

On the Parallel Complexity of Digraph Reachability.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

On the Detection of Robust Curves.

[BibT_eX]

[DOI]

CVGIP Graph. Model. Image Process., 1994

Pattern Matching in a Digitized Image.

[BibT_eX]

[DOI]

Algorithmica, 1994

Symmetry breaking for suffix tree construction.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix.

[BibT_eX]

[DOI]

Rajeev Raman

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

Optimal Parallel Approximation for Prefix Sums and Integer Sorting.

[BibT_eX]

[DOI]

Michael T. Goodrich

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

On a Parallel-Algorithms Method for String Matching Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1993

On Parallel Integer Merging

[BibT_eX]

[DOI]

Inf. Comput., October, 1993

Recursive Star-Tree Parallel Data Structure.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values.

[BibT_eX]

[DOI]

J. Algorithms, 1993

Approximate Parallel Prefix Computation and its Applications.

[BibT_eX]

[DOI]

Michael T. Goodrich

Proceedings of the Seventh International Parallel Processing Symposium, 1993

A primal-dual parallel approximation technique applied to weighted set and vertex cover.

[BibT_eX]

Neal E. Young

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

Two Dimensional Pattern Matching in a Digitized Image.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

1992

A Parallel Blocking Flow Algorithm for Acyclic Networks.

[BibT_eX]

[DOI]

J. Algorithms, 1992

Efficient Pattern Matching with Scaling.

[BibT_eX]

[DOI]

Amihood Amir

J. Algorithms, 1992

Randomized Range-Maxima in Nearly-Constant Parallel Time.

[BibT_eX]

[DOI]

Comput. Complex., 1992

A Case for the PRAM As a Standard Programmer's Model.

[BibT_eX]

[DOI]

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

Methods in Parallel Algorithmics (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Methods in Parallel Algorithmics and Who May Need to Know Them?

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

Randomized Range-Maxima inNearly-Constant Parallel Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms

[BibT_eX]

[DOI]

Inf. Comput., May, 1991

Can parallel algorithms enhance serial implementation.

[BibT_eX]

[DOI]

SIGACT News, 1991

Deterministic Sampling - A New Technique for Fast Pattern Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

On Parallel Hashing and Integer Sorting.

[BibT_eX]

[DOI]

J. Algorithms, 1991

Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Strutural Parallel Algorithmics.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Towards a Theory of Nearly Constant Time Parallel Algorithms

[BibT_eX]

[DOI]

Joseph Gil

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

On Parallel Hashing and Integer Sorting (Extended Summary).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Some Triply-Logarithmic Parallel Algorithms (Extended Abstract)

[BibT_eX]

[DOI]

Joseph F. JáJá

Sridhar Krishnamurthy

Ramakrishna Thurimella

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Faster Optimal Parallel Prefix Sums and List Ranking

[BibT_eX]

[DOI]

Inf. Comput., June, 1989

Fast Parallel and Serial Approximate String Matching.

[BibT_eX]

[DOI]

J. Algorithms, 1989

Highly Parallelizable Problems (Extended Abstract)

[BibT_eX]

[DOI]

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

Recursive *-Tree Parallel Data-Structure (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

On Finding a Minimum Dominating Set in a Tournament.

[BibT_eX]

[DOI]

Nimrod Megiddo

Theor. Comput. Sci., 1988

Matching Patterns in Strings Subject to Multi-Linear Transformations.

[BibT_eX]

[DOI]

Tali Eilam-Tzoreff

Theor. Comput. Sci., 1988

On Finding Lowest Common Ancestors: Simplification and Parallelization.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

Fast String Matching with k Differences.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1988

Locating alignments with k differences for nucleotide and amino acid sequences.

[BibT_eX]

[DOI]

Ruth Nussinov

Comput. Appl. Biosci., 1988

The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time.

[BibT_eX]

[DOI]

Algorithmica, 1988

Parallel Construction of a Suffix Tree with Applications.

[BibT_eX]

[DOI]

Algorithmica, 1988

Efficient Parallel Triconnectivity in Logarithmic Time.

[BibT_eX]

[DOI]

Vijaya Ramachandran

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

Tight Comparison Bounds on the Complexity of Parallel Sorting.

[BibT_eX]

[DOI]

Yossi Azar

SIAM J. Comput., 1987

Randomized Parallel Speedups for List Ranking.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1987

Parallel Construction of a Suffix Tree (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking

[BibT_eX]

[DOI]

Inf. Control., July, 1986

Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs.

[BibT_eX]

[DOI]

Yael Maon

Theor. Comput. Sci., 1986

Efficient String Matching with k Mismatches.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

An efficient string matching algorithm with k differences for nucleotide and amino acid sequences.

[BibT_eX]

[DOI]

Ruth Nussinov

Nucleic Acids Res., 1986

Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Tight Complexity Bounds for Parallel Comparison Sorting

[BibT_eX]

[DOI]

Noga Alon

Yossi Azar

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Yael Maon

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

Optimal Parallel Generation of a Computation Tree Form.

[BibT_eX]

[DOI]

Ilan Bar-On

ACM Trans. Program. Lang. Syst., 1985

Trade-Offs Between Depth and Width in Parallel Computation.

[BibT_eX]

[DOI]

Avi Wigderson

SIAM J. Comput., 1985

An Efficient Parallel Biconnectivity Algorithm.

[BibT_eX]

[DOI]

Robert Endre Tarjan

SIAM J. Comput., 1985

On Efficient Parallel Strong Orientation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

Optimal Parallel Pattern Matching in Strings

[BibT_eX]

[DOI]

Inf. Control., 1985

Efficient implementation of a shifting algorithm.

[BibT_eX]

[DOI]

Yehoshua Perl

Discret. Appl. Math., 1985

Solving NP-hard problems in 'almost trees': Vertex cover.

[BibT_eX]

[DOI]

Don Coppersmith

Discret. Appl. Math., 1985

Optimal Parallel Pattern Matching in Strings (Extended Summary).

[BibT_eX]

[DOI]

Proceedings of the Automata, 1985

Efficient String Matching in the Presence of Errors

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

Simulation of Parallel Random Access Machines by Circuits.

[BibT_eX]

[DOI]

SIAM J. Comput., 1984

Constant Depth Reducibility.

[BibT_eX]

[DOI]

Ashok K. Chandra

SIAM J. Comput., 1984

Finding Euler Tours in Parallel.

[BibT_eX]

[DOI]

Mikhail J. Atallah

J. Comput. Syst. Sci., 1984

Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems.

[BibT_eX]

[DOI]

Yuri Gurevich

J. ACM, 1984

An optimal parallel connectivity algorithm.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1984

Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories.

[BibT_eX]

[DOI]

Kurt Mehlhorn

Acta Informatica, 1984

Randomized Speed-Ups in Parallel Computation

[BibT_eX]

[DOI]

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary)

[BibT_eX]

[DOI]

Robert Endre Tarjan

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

Dynamic Parallel Memories

[BibT_eX]

[DOI]

Avi Wigderson

Inf. Control., March, 1983

An efficient distributed orientation algorithm.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1983

Implementation of Simultaneous Memory Address Access in Models That Forbid It.

[BibT_eX]

[DOI]

J. Algorithms, 1983

Parallel Computation on 2-3-Trees.

[BibT_eX]

[DOI]

Wolfgang J. Paul

Hubert Wagener

RAIRO Theor. Informatics Appl., 1983

Granularity of Memory in Parallel Computation.

[BibT_eX]

Kurt Mehlhorn

Proceedings of the WG '83, 1983

Parallel Dictionaries in 2-3 Trees.

[BibT_eX]

[DOI]

Wolfgang J. Paul

Hubert Wagener

Proceedings of the Automata, 1983

Trade-Offs between Depth and Width in Parallel Computation (Preliminary Version)

[BibT_eX]

[DOI]

Avi Wigderson

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

An O(n² log n) Parallel MAX-FLOW Algorithm.

[BibT_eX]

[DOI]

J. Algorithms, 1982

An O(log n) Parallel Connectivity Algorithm.

[BibT_eX]

[DOI]

J. Algorithms, 1982

Complexity of Finding k-Path-Free Dominating Sets in Graphs.

[BibT_eX]

[DOI]

Reuven Bar-Yehuda

Inf. Process. Lett., 1982

Golden ratios in a pairs covering problem.

[BibT_eX]

[DOI]

Shmuel Zaks

Discret. Math., 1982

A Complexity Theory for Unbounded Fan-In Parallelism

[BibT_eX]

[DOI]

Ashok K. Chandra

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981

Synchronized parallel computation.

[BibT_eX]

[DOI]

PhD thesis, 1981

Finding the Maximum, Merging, and Sorting in a Parallel Computation Model.

[BibT_eX]

[DOI]