Danny Krizanc

According to our database1, Danny Krizanc authored at least 205 papers between 1987 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Priority evacuation from a disk: The case of n = 1, 2, 3.
Theor. Comput. Sci., 2020

The Bike Sharing Problem.
CoRR, 2020

Weak Coverage of a Rectangular Barrier.
Algorithmica, 2020

2019
Search on a line with faulty robots.
Distributed Comput., 2019

Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model.
Proceedings of the Structural Information and Communication Complexity, 2019

Energy Consumption of Group Search on a Line.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Know when to persist: Deriving value from a stream buffer.
Theor. Comput. Sci., 2018

Priority Evacuation from a Disk Using Mobile Robots.
CoRR, 2018

Gathering in the Plane of Location-Aware Robots in the Presence of Spies.
Proceedings of the Structural Information and Communication Complexity, 2018

Priority Evacuation from a Disk Using Mobile Robots - (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2018

Satisfying Neighbor Preferences on a Circle.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

God Save the Queen.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots.
Algorithmica, 2017

Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Evacuation from a Disc in the Presence of a Faulty Robot.
Proceedings of the Structural Information and Communication Complexity, 2017

Weak Coverage of a Rectangular Barrier.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Linear Search with Terrain-Dependent Speeds.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults.
Proceedings of the Algorithms for Sensor Systems, 2017

2016
Mobile Agents and Exploration.
Encyclopedia of Algorithms, 2016

Encoding 2D range maximum queries.
Theor. Comput. Sci., 2016

Distributed algorithms for barrier coverage using relocatable sensors.
Distributed Comput., 2016

Search on a Line by Byzantine Robots.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Reconstructing Cactus Graphs from Shortest Path Information - (Extended Abstract).
Proceedings of the Algorithmic Aspects in Information and Management, 2016

Know When to Persist: Deriving Value from a Stream Buffer - (Extended Abstract).
Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015
Excuse me! or the courteous theatregoers' problem.
Theor. Comput. Sci., 2015

Complexity of barrier coverage with relocatable sensors in the plane.
Theor. Comput. Sci., 2015

Monitoring the Plane with Rotating Radars.
Graphs Comb., 2015

Randomized Rendezvous Algorithms for Agents on a Ring with Different Speeds.
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

Optimization Problems in Infrastructure Security.
Proceedings of the Foundations and Practice of Security - 8th International Symposium, 2015

Maintaining Intruder Detection Capability in a Rectangular Domain with Sensors.
Proceedings of the Algorithms for Sensor Systems, 2015

Wireless Autonomous Robot Evacuation from Equilateral Triangles and Squares.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 14th International Conference, 2015

2014
Editorial: Fun with Algorithms.
Theory Comput. Syst., 2014

Accuracy and efficiency of algorithms for the demarcation of bacterial ecotypes from DNA sequence data.
IJBRA, 2014

DMVP: Foremost Waypoint Coverage of Time-Varying Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Excuse Me! or The Courteous Theatregoers' Problem - (Extended Abstract).
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Multi-Robot Foremost Coverage of Time-Varying Graphs.
Proceedings of the Algorithms for Sensor Systems, 2014

2013
Enhancing Data Integrity and Privacy in the Cloud: An Agenda.
IEEE Computer, 2013

Asymptotic structural properties of quasi-random saturated structures of RNA.
Algorithms Mol. Biol., 2013

Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Optimal patrolling of fragmented boundaries.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

2012
Effectiveness and detection of denial-of-service attacks in tor.
ACM Trans. Inf. Syst. Secur., 2012

Maintaining Privacy on a Line.
Theory Comput. Syst., 2012

Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs.
Discrete Math., Alg. and Appl., 2012

Optimizing Data Throughput in Client/Server Systems by keeping Queue Sizes Balanced.
Discrete Math., Alg. and Appl., 2012

Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle.
Discrete Math., Alg. and Appl., 2012

Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Demarcation of bacterial ecotypes from DNA sequence data: A comparative analysis of four algorithms.
Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs.
Proceedings of the Computer Science - Theory and Applications, 2012

2011
Maintaining Connectivity in Sensor Networks Using Directional Antennae.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

Randomized rendezvous with limited memory.
ACM Trans. Algorithms, 2011

Deterministic symmetric rendezvous with tokens in a synchronous torus.
Discret. Appl. Math., 2011

Encoding 2-D Range Maximum Queries
CoRR, 2011

On the Complexity of the Multi-Robot, Multi-Depot Map Visitation Problem.
Proceedings of the IEEE 8th International Conference on Mobile Adhoc and Sensor Systems, 2011

Encoding 2D Range Maximum Queries.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Connectivity Trade-offs in 3D Wireless Sensor Networks Using Directional Antennae.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2010
The Mobile Agent Rendezvous Problem in the Ring
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2010

A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model
CoRR, 2010

Maximum Interference of Random Sensors on a Line.
Proceedings of the Structural Information and Communication Complexity, 2010

The Urinal Problem.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations.
Proceedings of the Combinatorial Optimization and Applications, 2010

On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment.
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 9th International Conference, 2010

2009
Balancing Traffic Load Using One-Turn Rectilinear Routing.
J. Interconnect. Networks, 2009

Asymptotics of Canonical and Saturated RNA Secondary Structures.
J. Bioinform. Comput. Biol., 2009

Random maximal independent sets and the unfriendly theater seating arrangement problem.
Discret. Math., 2009

Revitalizing computing education through free and open source software for humanity.
Commun. ACM, 2009

Sensor network connectivity with multiple directional antennae of a given angular sum.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Detecting Denial of Service Attacks in Tor.
Proceedings of the Financial Cryptography and Data Security, 2009

Inapproximability of the Perimeter Defense Problem.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Asymptotics of Canonical RNA Secondary Structures.
Proceedings of the Ninth IEEE International Conference on Bioinformatics and Bioengineering, 2009

Routing on Delay Tolerant Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment.
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, 2009

2008
Mobile Agents and Exploration.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Memoryless search algorithms in a network with faulty advice.
Theor. Comput. Sci., 2008

Review of "The Game's Afoot: Game Theory in Myth and Paradox by Alexander Mehlmann", American Mathematical Society, 2000, 0-8218-2121-0.
SIGACT News, 2008

Tracking Mobile Users in Cellular Networks using Timing Information.
Nord. J. Comput., 2008

A Characterization of the degree sequences of 2-trees.
Journal of Graph Theory, 2008

Realizing partitions respecting full and partial order information.
J. Discrete Algorithms, 2008

Computing Minimum Spanning Trees with Uncertainty.
Proceedings of the STACS 2008, 2008

Communication in wireless networks with directional antennas.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Randomized Rendez-Vous with Limited Memory.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Computing with Mobile Agents in Distributed Networks.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov-Jacobson energy model.
Discret. Appl. Math., 2007

Assigning Bookmarks in Perfect Binary Trees.
Ars Comb., 2007

Estimating Bacterial Diversity from Environmental DNA: A Maximum Likelihood Approach.
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

2006
Asynchronous deterministic rendezvous in graphs.
Theor. Comput. Sci., 2006

Efficient automatic simulation of parallel computation on networks of workstations.
Discret. Appl. Math., 2006

Routing with uncertainty in the position of the destination.
Proceedings of the 2006 IEEE International Conference on Wireless and Mobile Computing, 2006

An Algorithmic Theory of Mobile Agents.
Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Mobile Agent Rendezvous: A Survey.
Proceedings of the Structural Information and Communication Complexity, 2006

Mobile Agent Rendezvous in a Synchronous Torus.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Topic 12: Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2005
Range Mode and Range Median Queries on Lists and Trees.
Nord. J. Comput., 2005

Efficient Update Strategies for Geometric Computing with Uncertainty.
Theory Comput. Syst., 2005

2004
Compact Routing Schemes for Dynamic Ring Networks.
Theory Comput. Syst., 2004

A reservation-based multicast protocol for WDM optical star networks.
IEEE J. Sel. Areas Commun., 2004

Sorting and election in anonymous asynchronous rings.
J. Parallel Distributed Comput., 2004

Approximate hotlink assignment.
Inf. Process. Lett., 2004

Searching with mobile agents in networks with liars.
Discret. Appl. Math., 2004

Mobile Agents Rendezvous When Tokens Fail.
Proceedings of the Structural Information and Communication Complexity, 2004

Directional Versus Omnidirectional Antennas for Energy Consumption and k-Connectivity of Networks of Sensors.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Multiple Mobile Agent Rendezvous in a Ring.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Coverage and Connectivity in Networks with Directional Sensors.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

Topic 13: Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

Improving Distance Based Geographic Location Techniques in Sensor Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory.
Networks, 2003

Asymmetric Communication Protocols via Hotlink Assignments.
Theory Comput. Syst., 2003

Enhancing Hyperlink Structure for Improving Web Performance.
J. Web Eng., 2003

Tracking Users in Cellular Networks using Timing Information.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Mobile Agent Rendezvous in a Ring.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

Optimizing Web Server's Data Transfer with Hotlinks.
Proceedings of the IADIS International Conference WWW/Internet 2003, 2003

Topic Introduction.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

2002
The impact of information on broadcasting time in linear radio networks.
Theor. Comput. Sci., 2002

Station Layouts in the Presence of Location Constraints.
J. Interconnect. Networks, 2002

The Hotlink Optimizer.
Proceedings of the International Conference on Internet Computing, 2002

A reservation based medium access control protocol with multicast support for optical star networks.
Proceedings of the Global Telecommunications Conference, 2002

2001
Introduction: Discrete Algorithms and Methods for Mobility.
Wirel. Networks, 2001

Rigorous results for random (2+p)-SAT.
Theor. Comput. Sci., 2001

On Recognizing a String on an Anonymous Ring.
Theory Comput. Syst., 2001

Fault-Tolerant Broadcasting in Radio Networks.
J. Algorithms, 2001

Convexifying polygons with simple projections.
Inf. Process. Lett., 2001

Ray shooting from convex ranges.
Discret. Appl. Math., 2001

Random Constraint Satisfaction: A More Accurate Picture.
Constraints An Int. J., 2001

Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval.
Comput. J., 2001

Efficient Routing in Networks with Long Range Contacts.
Proceedings of the Distributed Computing, 15th International Conference, 2001

2000
Power consumption in packet radio networks.
Theor. Comput. Sci., 2000

Book review: Gems of Theoretical Computer Science by Uwe Schöning and Randall Pruim (Springer-Verlag, 1998).
SIGACT News, 2000

Distributed Online Frequency Assignment in Cellular Networks.
J. Algorithms, 2000

Locating Information with Uncertainty in Fully Interconnected Networks.
Proceedings of the Distributed Computing, 14th International Conference, 2000

Strategies for Hotlink Assignments.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Sorting Multisets in Anonymous Rings.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

Efficient Automatic Simulation of Parallel Computation on Network of Workstations.
Proceedings of the ICALP Workshops 2000, 2000

1999
Review of Probabilistic Combinatorics and Its Applications: editor: Béla Bollobás.
SIGACT News, 1999

Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks.
SIAM J. Comput., 1999

Bulk synchronous parallel: practical experience with a model for parallel computing.
Parallel Comput., 1999

Baked-Potato Routing.
J. Algorithms, 1999

Minimizing Congestion of Layouts for ATM Networks with Faulty Links.
Int. J. Found. Comput. Sci., 1999

Searching with Uncertainty.
Proceedings of the SIROCCO'99, 1999

Dynamic Interval Routing on Asynchronous Rings.
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

The Impact of Knowledge on Broadcasting Time in Radio Networks.
Proceedings of the Algorithms, 1999

Near optimal-partitioning of rectangles and prisms.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Approximate Maxima Finding of Continuous Functions under Restricted Budget.
Theor. Comput. Sci., 1998

Approximating the unsatisfiability threshold of random formulas.
Random Struct. Algorithms, 1998

Efficient Regular Polygon Dissections.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Polygon Cutting: Revisited.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

A Survey of Randomness and Parallelism in Comparison Problems.
Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

High-Speed Networks.
Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract).
Proceedings of the Algorithms, 1998

1997
Planar Stage Graphs: Characterizations and Applications.
Theor. Comput. Sci., 1997

Time-Message Trade-Offs for the Weak Unison Problem.
Nord. J. Comput., 1997

New Graph Decompositions with Applications to Emulations.
Theory Comput. Syst., 1997

Distributed Computing on Anonymous Hypercube Networks.
J. Algorithms, 1997

Hop-Congestion Trade-Offs for High-Speed Networks.
Int. J. Found. Comput. Sci., 1997

The VC-dimension of Set Systems Defined by Graphs.
Discret. Appl. Math., 1997

Stage-graph Representations.
Discret. Appl. Math., 1997

Power Consumption in Packet Radio Networks (Extended Abstract).
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Discrete Realizations of Contact and Intersection Graphs.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Many-to-One Packed Routing via Matchings.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
Time-Randomness Trade-offs in Parallel Computation.
J. Algorithms, 1996

On Multi-Label Linear Interval Routing Schemes.
Comput. J., 1996

Fast Deterministic Selection on Mesh-Connected Processor Arrays.
Algorithmica, 1996

Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Lower Bounds for Compact Routing (Extended Abstract).
Proceedings of the STACS 96, 1996

Boolean Routing on Cayley Networks.
Proceedings of the SIROCCO'96, 1996

The Complexity of Data Mining on the Web (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Baked Potatoes: Deadlock Prevention Via Scheduling (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Multipacket Hot-Potato Routing on Processor Arrays.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract).
Proceedings of the Algorithms, 1996

A better upper bound for the unsatisfiability threshold.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996

Maximal Length Common Non-intersecting Paths.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
Zero-One Sorting on the Mesh.
Parallel Process. Lett., 1995

Labeled Versus Unlabeled Distributed Cayley Networks.
Discret. Appl. Math., 1995

VC-Dimensions for Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract).
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Boolean Routing on Chordal Rings.
Proceedings of the Structure, Information and Communication Complexity, 1995

Implicit Routing and Shortest Path Information (Extended Abstract).
Proceedings of the Structure, Information and Communication Complexity, 1995

String Recognition on Anonymous Rings.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Optimal Shooting: Characterizations and Applications.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994
Computing Boolean Functions on Anonymous Networks
Inf. Comput., November, 1994

Optimal Coteries and Voting Schemes.
Inf. Process. Lett., 1994

On the Number of Directions in Visibility Representations.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Sorting and Selection on Arrays with Diagonal Connections.
Proceedings of the Parallel and Distributed Computing, 1994

On Key Distribution via True Broadcasting.
Proceedings of the CCS '94, 1994

1993
A Comparison of Meshes with Static Buses and Half-Duplex Wrap-Arounds.
Parallel Process. Lett., 1993

Integer Sorting on a Mesh-Connected Array of Processors.
Inf. Process. Lett., 1993

On Multi-Label Linear Interval Routing Schemes (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

A Time-Randomness Tradeoff for Selection in Parallel.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

New Graph Decompositions and Fast Emulations in Hypercubes and Butterflies.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Universal Emulations with Sublogarithmic Slowdown
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
The Average Complexity of Parallel Comparison Merging.
SIAM J. Comput., 1992

Optimal Algorithms for Selection on a Mesh-Connected Processor Array.
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Distributed Computing on Cayley Networks (Extended Abstract).
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Simple Path Selection for Optimal Routing on Processor Arrays.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Optimal Sorting on Mesh-Connected Processor Arrays.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Multipacket Selection on Mesh-Connected Processor Arrays.
Proceedings of the 6th International Parallel Processing Symposium, 1992

1991
A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array.
Parallel Process. Lett., 1991

Tight Bounds for Oblivious Routing in the Hypercube.
Math. Syst. Theory, 1991

Oblivious Routing with Limited Buffer Capacity.
J. Comput. Syst. Sci., 1991

Off-line routing with small queues on a mesh-connected processor array.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version).
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

1988
A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Optimal Routing Algorithms for Mesh-Connected Processor Arrays.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
The Complexity of Parallel Comparison Merging
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987


  Loading...