A. Yavuz Oruç

Affiliations:
  • University of Maryland, College Park, USA


According to our database1, A. Yavuz Oruç authored at least 66 papers between 1984 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Quantum Buffer Design Using Petri Nets.
CoRR, 2024

2023
Faster quantum concentration via Grover's search.
Int. J. Parallel Emergent Distributed Syst., September, 2023

Big data processing with 1D-Crosspoint Arrays.
Int. J. Parallel Emergent Distributed Syst., May, 2023

2021
CodeAPeel: An Integrated and Layered Learning Technology For Computer Architecture Courses.
CoRR, 2021

2020
Searching and Sorting with O(n<sup>2</sup>) processors in O(1) time.
CoRR, 2020

2019
On the size of two families of unlabeled bipartite graphs.
AKCE Int. J. Graphs Comb., 2019

2017
A Self-Routing on-Chip Network.
IEEE Trans. Parallel Distributed Syst., 2017

2015
One-sided binary tree-crossbar switching for on-chip networks.
Proceedings of the 49th Annual Conference on Information Sciences and Systems, 2015

2011
Self-Routing Quantum Sparse Crossbar Packet Concentrators.
IEEE Trans. Computers, 2011

2010
Multicasting in Quantum Switching Networks.
IEEE Trans. Computers, 2010

Ordinal covering using block designs.
Proceedings of the IEEE International Conference on Systems, 2010

Ordinal evaluation and assignment problems.
Proceedings of the IEEE International Conference on Systems, 2010

2009
On Ordinal Covering of Proposals Using Balanced Incomplete Block Designs
CoRR, 2009

Asymptotically Optimal Assignments In Ordinal Evaluations of Proposals
CoRR, 2009

2007
On Matrix Multiplication Using Programmable Graph Architecture.
Proceedings of the 41st Annual Conference on Information Sciences and Systems, 2007

Quantum Switching Networks with Classical Routing.
Proceedings of the 41st Annual Conference on Information Sciences and Systems, 2007

2006
Affine Image Warping on Programmable Graph Architecture using Grid Space Algebra.
Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

On Random Routing and its Application to Quantum Interconnection Networks.
Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

Performance of PGA (Programmable Graph Architecture) for Matrix Multiplications.
Proceedings of the 5th Annual IEEE/ACIS International Conference on Computer and Information Science (ICIS 2006) and 1st IEEE/ACIS International Workshop on Component-Based Software Engineering, 2006

1998
Regular Sparse Crossbar Concentrators.
IEEE Trans. Computers, 1998

1997
The Design of an Optoelectronic Arithmetic Processor Based on Permutation Networks.
IEEE Trans. Computers, 1997

Structure and density of sparse crossbar concentrators.
Proceedings of the Advances in Switching Networks, 1997

1996
Crosspoint complexity of sparse crossbar concentrators.
IEEE Trans. Inf. Theory, 1996

1995
Efficient Nonblocking Switching Networks for Interprocessor Communications in Multiprocessor Systems.
IEEE Trans. Parallel Distributed Syst., 1995

A Fast Parallel Algorithm for Routing Unicast Assignments in Benes Networks.
IEEE Trans. Parallel Distributed Syst., 1995

Design of efficient and easily routable generalized connectors.
IEEE Trans. Commun., 1995

1994
A fault-tolerant permutation network modulo arithmetic processor.
IEEE Trans. Very Large Scale Integr. Syst., 1994

Adaptive Binary Sorting Schemes and Associated Interconnection Networks.
IEEE Trans. Parallel Distributed Syst., 1994

The complexity of routing in Clos permutation networks.
IEEE Trans. Inf. Theory, 1994

High performance concentrators and superconcentrators using multiplexing schemes.
IEEE Trans. Commun., 1994

Constant Time Inner Product and Matrix Computations on Permutation Network Processors.
IEEE Trans. Computers, 1994

Applications of matching and edge-coloring algorithms to routing in clos networks.
Networks, 1994

A Study of Permutation Networks: New Designs and Some Generalizations.
J. Parallel Distributed Comput., 1994

Distirubted Routing Schemes for Strictly Nonblocking Networks.
Proceedings of the Proceedings 1994 International Conference on Parallel and Distributed Systems, 1994

1993
On self-routing in Clos connection networks.
IEEE Trans. Commun., 1993

A nonbacktracking matrix decomposition algorithm for routing on Clos networks.
IEEE Trans. Commun., 1993

Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network.
IEEE Trans. Computers, 1993

Fast Parallle Algorithms for Routing One-To-One Assignments in Benes Networks.
Proceedings of the 1993 International Conference on Parallel Processing, 1993

1992
Efficient Networks for Realizing Point-toPoint Assignments in Parallel Processors.
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

1991
Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh Maps.
IEEE Trans. Computers, 1991

Parallel Modular Arithmetic on a Permutation Network.
Proceedings of the International Conference on Parallel Processing, 1991

Fast Self-Routing Permutation Networks.
Proceedings of the International Conference on Parallel Processing, 1991

Optimal Non blocking Networks with Pin Constraints.
Proceedings of the International Conference on Parallel Processing, 1991

1990
Systolic arrays for multidimensional discrete transforms.
J. Supercomput., 1990

A Self-Routing Permutation Network.
J. Parallel Distributed Comput., 1990

Self-Routing and Route Balancing in Connection Networks.
Proceedings of the 1990 International Conference on Parallel Processing, 1990

Efficient Routing Techniques for Cooperating Processors in Dataflow Computers.
Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, 1990

PSB Graphs for Simulating Cooperative and Distributed Program Behavior.
Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, 1990

1989
Coset networks as connectors in parallel processors.
J. Supercomput., 1989

On Systolic Contractions of Program Graphs.
IEEE Trans. Computers, 1989

A Systematic Design of Cellular Permutation Arrays.
IEEE Trans. Computers, 1989

1987
Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups.
IEEE Trans. Computers, 1987

Designing Cellular Permutation Networks through Coset Decompositions of Symmetric Groups.
J. Parallel Distributed Comput., 1987

Cellular Permutation Network Designs with Coset Generators.
Proceedings of the International Conference on Parallel Processing, 1987

Multistage Permutation Network Design with Double Coset Generators.
Proceedings of the International Conference on Parallel Processing, 1987

1986
A Facility for Simulating Multiprocessors.
IEEE Micro, 1986

Synthesis of a Family of Cellular Permutation Arrays.
Proceedings of the International Conference on Parallel Processing, 1986

Euclid: An Architectural Multiprocessor Simulator.
Proceedings of the 6th International Conference on Distributed Computing Systems, 1986

Linear-time algorithms for programming cellular permutation arrays.
Proceedings of the 14th ACM Annual Conference on Computer Science, 1986

New algorithms for realizing paths and permutations through cube-connected networks.
Proceedings of the 14th ACM Annual Conference on Computer Science, 1986

1985
Reconfiguration Alfoithms for Interconnection Networks.
IEEE Trans. Computers, 1985

On Testing Isomorphism of Permutation Networks.
IEEE Trans. Computers, 1985

Equivalence relations among interconnection networks.
J. Parallel Distributed Comput., 1985

On Testing Permutation Network Isomorphisms.
Proceedings of the International Conference on Parallel Processing, 1985

1984
Routing Algorithms for Cellular Interconnection Arrays.
IEEE Trans. Computers, 1984

A Classification of Cube-Connected Networks with a Simple Control Scheme.
IEEE Trans. Computers, 1984


  Loading...