Kazuo Iwama

According to our database1, Kazuo Iwama
  • authored at least 225 papers between 1977 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Letter from the Bulletin Editor.
Bulletin of the EATCS, 2017

Improved Average Complexity for Comparison-Based Sorting.
CoRR, 2017

Improved Average Complexity for Comparison-Based Sorting.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016
Stable Marriage with Ties and Incomplete Lists.
Encyclopedia of Algorithms, 2016

Exact Algorithms for k SAT Based on Local Search.
Encyclopedia of Algorithms, 2016

Approximate strip packing: Revisited.
Inf. Comput., 2016

Letter from the Bulletin Editor.
Bulletin of the EATCS, 2016

Letter from the Bulletin Editor.
Bulletin of the EATCS, 2016

Letter from the Bulletin Editor.
Bulletin of the EATCS, 2016

Quantum Query Complexity of Almost All Functions with Fixed On-set Size.
Computational Complexity, 2016

The Hospitals/Residents Problem with Lower Quotas.
Algorithmica, 2016

Total Stability in Stable Matching Games.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

2015
Finding Witnesses for Stability in the Hospitals/Residents Problem.
JIP, 2015

Online bin packing with (1, 1) and (2, R) bins.
J. Comb. Optim., 2015

Letter from the Bulletin Editor.
Bulletin of the EATCS, 2015

Letter from the Bulletin Editor.
Bulletin of the EATCS, 2015

Letter from the Bulletin Editor.
Bulletin of the EATCS, 2015

Stable Nash Equilibria in the Gale-Shapley Matching Game.
CoRR, 2015

A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties.
Proceedings of the Approximation, 2015

2014
Letter from the Bulletin Editor.
Bulletin of the EATCS, 2014

Letter from the Bulletin Editor.
Bulletin of the EATCS, 2014

Letter from the Bulletin Editor.
Bulletin of the EATCS, 2014

Reputation games for undirected graphs.
Discrete Applied Mathematics, 2014

Correction: Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts. Algorithms 2014, 7, 166-185.
Algorithms, 2014

A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties.
Algorithmica, 2014

Read-Once Branching Programs for Tree Evaluation Problems.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Parameterized testability.
Proceedings of the Innovations in Theoretical Computer Science, 2014

2013
A Harmonic Algorithm for the 3D Strip Packing Problem.
SIAM J. Comput., 2013

Recovering Strings in Oracles: Quantum and Classic.
Int. J. Found. Comput. Sci., 2013

Letter from the Bulletin Editor.
Bulletin of the EATCS, 2013

Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists.
Algorithms, 2013

The Train Delivery Problem Revisited.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Online Bin Packing with (1, 1) and (2, R) Bins.
Proceedings of the Combinatorial Optimization and Applications, 2013

2012
Quantum counterfeit coin problems.
Theor. Comput. Sci., 2012

Improved approximation bounds for the Student-Project Allocation problem with preferences over projects.
J. Discrete Algorithms, 2012

Reputation Games for Undirected Graphs
CoRR, 2012

Reconstructing Strings from Substrings with Quantum Queries
CoRR, 2012

Approximability of Stable Matching Problems.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Reconstructing Strings from Substrings with Quantum Queries.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Recovering Strings in Oracles: Quantum and Classic.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
A randomized algorithm for two servers in cross polytope spaces.
Theor. Comput. Sci., 2011

Average-case competitive analyses for one-way trading.
J. Comb. Optim., 2011

Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects.
Proceedings of the Theory and Applications of Models of Computation, 2011

Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

The Hospitals/Residents Problem with Quota Lower Bounds.
Proceedings of the Algorithms - ESA 2011, 2011

2010
The complexity of the Hajós calculus for planar graphs.
Theor. Comput. Sci., 2010

Approximation algorithms for the sex-equal stable marriage problem.
ACM Trans. Algorithms, 2010

Online knapsack with resource augmentation.
Inf. Process. Lett., 2010

The Planar Hajós Calculus for Bounded Degree Graphs.
IEICE Transactions, 2010

Quantum Counterfeit Coin Problems
CoRR, 2010

Guest Editorial: Special Issue on Matching Under Preferences.
Algorithmica, 2010

Improved Randomized Algorithms for 3-SAT.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Quantum Counterfeit Coin Problems.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties.
Proceedings of the Algorithms, 2010

Averaging Techniques for Competitive Auctions.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2009
Enumeration of isolated cliques and pseudo-cliques.
ACM Trans. Algorithms, 2009

Drawing Borders Efficiently.
Theory Comput. Syst., 2009

An improved approximation lower bound for finding almost stable maximum matchings.
Inf. Process. Lett., 2009

Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size
CoRR, 2009

Negation-Limited Complexity of Parity and Inverters.
Algorithmica, 2009

Quantum Queries on Permutations with a Promise.
Proceedings of the Implementation and Application of Automata, 2009

2008
Stable Marriage with Ties and Incomplete Lists.
Proceedings of the Encyclopedia of Algorithms, 2008

Local Search Algorithms for kSAT.
Proceedings of the Encyclopedia of Algorithms, 2008

Reductions for monotone Boolean circuits.
Theor. Comput. Sci., 2008

Online Removable Square Packing.
Theory Comput. Syst., 2008

Online chasing problems for regular polygons.
Inf. Process. Lett., 2008

New Graph Calculi for Planar Non-3-Colorable Graphs.
IEICE Transactions, 2008

The Complexity of the Hajos Calculus for Planar Graphs.
Electronic Colloquium on Computational Complexity (ECCC), 2008

On Two Dimensional Orthogonal Knapsack Problem
CoRR, 2008

Editor's Foreword.
Algorithms, 2008

Randomized Competitive Analysis for Two Server Problems.
Algorithms, 2008

A (2-c(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem.
Algorithmica, 2008

Max-Stretch Reduction for Tree Spanners.
Algorithmica, 2008

SAT, UNSAT and Coloring.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Quantum Query Complexity of Boolean Functions with Small On-Sets.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Polynomial-Time Construction of Linear Network Coding.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Randomized Competitive Analysis for Two-Server Problems.
Proceedings of the Algorithms, 2008

08431 Open Problems - Moderately Exponential Time Algorithms.
Proceedings of the Moderately Exponential Time Algorithms, 19.10. - 24.10.2008, 2008

08431 Executive Summary - Moderately Exponential Time Algorithms.
Proceedings of the Moderately Exponential Time Algorithms, 19.10. - 24.10.2008, 2008

08431 Abstracts Collection - Moderately Exponential Time Algorithms.
Proceedings of the Moderately Exponential Time Algorithms, 19.10. - 24.10.2008, 2008

Average-Case Competitive Analyses for One-Way Trading.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Improved algorithms for quantum identification of Boolean oracles.
Theor. Comput. Sci., 2007

Improved approximation results for the stable marriage problem.
ACM Trans. Algorithms, 2007

Exploiting partial knowledge of satisfying assignments.
Discrete Applied Mathematics, 2007

A Randomized Algorithm for Two Servers in Cross Polytope Spaces.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Approximation Algorithms for the Sex-Equal Stable Marriage Problem.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Quantum Network Coding.
Proceedings of the STACS 2007, 2007

A 1.875: approximation algorithm for the stable marriage problem.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Harmonic algorithm for 3-dimensional strip packing problem.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Online Chasing Problems for Regular n-Gons.
Proceedings of the 2007 IEEE International Conference on Research, 2007

Unbounded-Error Classical and Quantum Communication Complexity.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Unbounded-Error One-Way Classical and Quantum Communication Complexity.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Drawing Borders Efficiently.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

An Improved Exact Algorithm for Cubic Graph TSP.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Properties of Symmetric Incentive Compatible Auctions.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Flow Time Minimization under Energy Constraints.
Proceedings of the 12th Conference on Asia South Pacific Design Automation, 2007

Optimal Resource Augmentations for Online Knapsack.
Proceedings of the Approximation, 2007

Strip Packing vs. Bin Packing.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Quantum lower bounds for the Goldreich-Levin problem.
Inf. Process. Lett., 2006

A (2 - clog N/N)-Approximation Algorithm for the Stable Marriage Problem.
IEICE Transactions, 2006

Efficient Methods for Determining DNA Probe Orders.
IEICE Transactions, 2006

Approximated Vertex Cover for Graphs with Perfect Matchings.
IEICE Transactions, 2006

Strip Packing vs. Bin Packing.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Density condensation of Boolean formulas.
Discrete Applied Mathematics, 2006

New Upper Bounds on The Approximability of 3D Strip Packing
CoRR, 2006

Strip Packing vs. Bin Packing
CoRR, 2006

Classic and Quantum Network Coding.
Proceedings of the Algorithm Theory, 2006

Improved Algorithms for Quantum Identification of Boolean Oracles.
Proceedings of the Algorithm Theory, 2006

Reductions for Monotone Boolean Circuits.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Negation-Limited Complexity of Parity and Inverters.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Stable Matching Problems.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Finite-State Online Algorithms and Their Automated Competitive Analysis.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Quantum Network Coding.
Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

2005
Single backup table schemes for shortest-path routing.
Theor. Comput. Sci., 2005

Quantum Sampling for Balanced Allocations.
IEICE Transactions, 2005

Compact Routing with Stretch Factor of Less Than Three.
IEICE Transactions, 2005

Average-Case Competitive Analyses for Ski-Rental Problems.
Algorithmica, 2005

Online Removable Square Packing.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Max-stretch Reduction for Tree Spanners.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Approximating vertex cover on dense graphs.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Classic and Quantum Network Coding.
Proceedings of the 8th International Symposium on Parallel Architectures, 2005

A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

The Delayed k-Server Problem.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Linear-Time Enumeration of Isolated Cliques.
Proceedings of the Algorithms, 2005

Average-Case Competitive Analyses for Ski-Rental Problems.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004
Randomized approximation of the stable marriage problem.
Theor. Comput. Sci., 2004

Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs.
J. Parallel Distrib. Comput., 2004

The orthogonal CNN problem.
Inf. Process. Lett., 2004

Worst-Case Upper Bounds for kSAT (Column: Algorithmics).
Bulletin of the EATCS, 2004

A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem.
Proceedings of the Algorithm Theory, 2004

Quantum Identification of Boolean Oracles.
Proceedings of the STACS 2004, 2004

Improved upper bounds for 3-SAT.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Approximated Two Choices in Randomized Load Balancing.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Imperfectness of Data for STS-Based Physical Mapping.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Approximated Vertex Cover for Graphs with Perfect Matchings.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
A family of NFAs which need 2n- deterministic states.
Theor. Comput. Sci., 2003

Approximability results for stable marriage problems with ties.
Theor. Comput. Sci., 2003

Transformation Rules for CNOT-based Quantum Circuits and Their Applications.
New Generation Comput., 2003

A New Quantum Claw-finding Algorithm for Three Functions.
New Generation Comput., 2003

Avoiding Routing Loops on the Internet.
Theory Comput. Syst., 2003

Inclusion-exclusion for k-CNF formulas.
Inf. Process. Lett., 2003

Improved Upper Bounds for 3-SAT
Electronic Colloquium on Computational Complexity (ECCC), 2003

Compact Routing for Flat Networks.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Polynomial-Time Computable Backup Tables for Shortest-Path Routing.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Density Condensation of Boolean Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Improved Approximation of the Stable Marriage Problem.
Proceedings of the Algorithms, 2003

Quantum Sampling for Balanced Allocations.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

Randomized Approximation of the Stable Marriage Problem.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
Hard variants of stable marriage.
Theor. Comput. Sci., 2002

Online independent sets.
Theor. Comput. Sci., 2002

Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.
ACM Journal of Experimental Algorithmics, 2002

Complexity of finding dense subgraphs.
Discrete Applied Mathematics, 2002

Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations.
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

Avoiding Routing Loops on the Internet.
Proceedings of the SIROCCO 9, 2002

Compact routing for average-case networks.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

An Explicit Lower Bound of 5n - o(n) for Boolean Circuits.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Inapproximability Results on Stable Marriage Problems.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Average-Case Competitive Analyses for Ski-Rental Problems.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Removable Online Knapsack Problems.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Transformation rules for designing CNOT-based quantum circuits.
Proceedings of the 39th Design Automation Conference, 2002

2001
Efficient randomized routing algorithms on the two-dimensional mesh of buses.
Theor. Comput. Sci., 2001

New Bounds for Oblivious Mesh Routing.
J. Graph Algorithms Appl., 2001

An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size.
J. Algorithms, 2001

A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes.
J. Algorithms, 2001

Exploiting Partial Knowledge of Satisfying Assignments.
Proceedings of the Algorithm Engineering, 2001

Separating Oblivious and Non-oblivious BPs.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs.
Theor. Comput. Sci., 2000

Oblivious Routing Algorithms on the Mesh of Buses.
J. Parallel Distrib. Comput., 2000

Greedily Finding a Dense Subgraph.
J. Algorithms, 2000

Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.
Proceedings of the Algorithm Engineering, 2000

A (2.954 epsilon)n oblivious routing algorithm on 2D meshes.
SPAA, 2000

Compact routing with stretch factor of less than three (brief announcement).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

A Family of NFA's Which Need 2n -alpha Deterministic States.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Online Independent Sets.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
Approximation of coNP sets by NP-complete sets and its applications.
Systems and Computers in Japan, 1999

Undecidability on Quantum Finite Automata.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Stable Marriage with Incomplete Lists and Ties.
Proceedings of the Automata, 1999

Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing.
Proceedings of the Algorithms, 1999

Using Generalized Forecasts for Online Currency Conversion.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
A Canonical Form of Vector Machines.
Inf. Comput., 1998

Better Approximations of Non-Hamiltonian Graphs.
Discrete Applied Mathematics, 1998

Optimizing OBDDs Is Still Intractable for Monotone Functions.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Improved Time and Space Hierarchies of One-Tape Off-Line TMs.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

New Bounds for Oblivious Mesh Routing.
Proceedings of the Algorithms, 1998

Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997
A Faster Parallel Algorithm for k-Connectivity.
Inf. Process. Lett., 1997

Complexity of Finding Short Resolution Proofs.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Oblivious Routing Algorithms on the Mesh of Buses.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing.
Proceedings of the Algorithms, 1997

Tight Bounds on the Number of States of DFA's That Are Equivalent to n-state NFA's.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Random benchmark circuits with controlled attributes.
Proceedings of the European Design and Test Conference, 1997

Local Search Algorithms for Partial MAXSAT.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996
Time Lower Bounds do not Exist for CRCW PRAMs.
Theor. Comput. Sci., 1996

Routing Problems on the Mesh of Buses.
J. Algorithms, 1996

alpha-Connectivity: A Gradually Nonparallel Graph Problem.
J. Algorithms, 1996

Greedily Finding a Dense Subgraph.
Proceedings of the Algorithm Theory, 1996

Satisfiability of 3CNF formulas with small clause/variable-ratio.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996

Database Queries as Combinatorial Optimization Problems.
CODAS, 1996

Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

Adding New Clauses for Faster Local Search.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995
Exponential Lower Bounds for the Tree-Like Hajós Calculus.
Inf. Process. Lett., 1995

Finding Dense Subgraphs.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Approximation of coNP Sets by NP-complete Sets.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

Intractability of Read-Once Resolution.
Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1994
A Simpler Parallel Algorithm for Graph Conectivity.
J. Algorithms, 1994

Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

SAT-Varible Complexity of Hard Combinatorial Problems.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Random Generation of Test Instances for Logic Optimizers.
Proceedings of the 31st Conference on Design Automation, 1994

1993
ASPACE(o(log log n)) is Regular.
SIAM J. Comput., 1993

Rs-vector algorithms for combinational problems.
Systems and Computers in Japan, 1993

Low-Level Tradeoffs between Reversals and Alternations.
Proceedings of the Developments in Language Theory, 1993

Random generation of test instances ith controlled attributes.
Proceedings of the Cliques, 1993

1992
Routing Problems on the Mesh of Buses.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

Random Generation of Satisfiable and Unsatisfiable CNF Predicates.
Proceedings of the Algorithms, Software, Architecture, 1992

1989
CNF Satisfiability Test by Counting and Polynomial Average Time.
SIAM J. Comput., 1989

An O(log n) Parallel Connectivity Algorithm on the Mesh of Buses.
IFIP Congress, 1989

1983
The Universe Problem for Unrestricted Flow Languages.
Acta Inf., 1983

Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous Time-Multiplexed Communication
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1982
On Equations Including String Variables
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1977
Labolink: An Optically Linked Laboratory Computer Network.
IEEE Computer, 1977


  Loading...