UB Paderborn / Katalog / Suche / in CDI

A Maximum Likelihood Stereo Algorithm

Computer vision and image understanding, 1996-05, Vol.63 (3), p.542-567

1996

Volltextzugriff (PDF)

Improved routing and sorting on multibutterflies

Algorithmica, 2000-12, Vol.28 (4), p.438-464

2000

Volltextzugriff (PDF)

An Experimental Analysis of Parallel Sorting Algorithms

Theory of computing systems, 1998-03, Vol.31 (2), p.135-167

1998

Volltextzugriff (PDF)

On the Bisection Width and Expansion of Butterfly Networks

Theory of computing systems, 2001-12, Vol.34 (6), p.491-518

2001

Volltextzugriff (PDF)

Sorting-based selection algorithms for hypercubic networks

Algorithmica, 2000-02, Vol.26 (2), p.237-254

2000

Volltextzugriff (PDF)

On Balls and Bins with Deletions

Lecture notes in computer science, 1998, p.145-158

1998

Volltextzugriff (PDF)

A parallel algorithm for reconfiguring a multibutterfly network with faulty switches

IEEE transactions on computers, 1994-03, Vol.43 (3), p.321-326

1994

Volltextzugriff (PDF)

On-line algorithms for path selection in a nonblocking network

SIAM journal on computing, 1996-06, Vol.25 (3), p.600-625

1996

Volltextzugriff (PDF)

Minimum-cost spanning tree as a path-finding problem

Information processing letters, 1988-01, Vol.26 (6), p.291-293

1988

Volltextzugriff (PDF)

On the fault tolerance of some popular bounded-degree networks

SIAM journal on computing, 1998-10, Vol.27 (5), p.1303-1333

1998

Volltextzugriff (PDF)

Simple algorithms for routing on butterfly networks with bounded queues

SIAM journal on computing, 1998-01, Vol.28 (3), p.984-1003

1998

Volltextzugriff (PDF)

Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks

IEEE transactions on computers, 1992-05, Vol.41 (5), p.578-587

1992

Volltextzugriff (PDF)

Randomized Routing and Sorting on Fixed-Connection Networks

Journal of algorithms, 1994-07, Vol.17 (1), p.157-205

1994

Volltextzugriff (PDF)

On the bisection width and expansion of butterfly networks

Proceedings - International Parallel Processing Symposium, 1998, p.144-150

1998

Volltextzugriff (PDF)

Protocols for Asymmetric Communication Channels

Journal of computer and system sciences, 2001-12, Vol.63 (4), p.573-596

2001

Volltextzugriff (PDF)

Invalidation Clues for Database Scalability Services

2007 IEEE 23rd International Conference on Data Engineering, 2007, p.316-325

2007

Volltextzugriff (PDF)

Reconfiguring arrays with faults. Part I: Worst-case faults

SIAM journal on computing, 1997-12, Vol.26 (6), p.1581-1611

1997

Volltextzugriff (PDF)

Tight Analyses of Two Local Load Balancing Algorithms

SIAM journal on computing, 1999, Vol.29 (1), p.29-64

1999

Volltextzugriff (PDF)

Real-time emulations of bounded-degree networks: Parallel models

Information processing letters, 1998, Vol.66 (5), p.269-276

1998

Volltextzugriff (PDF)

Models of parallel computation: a survey and synthesis

Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences, 1995, Vol.2, p.61-70 vol.2

1995

Volltextzugriff (PDF)

Work-preserving emulations of fixed-connection networks

Journal of the ACM, 1997-01, Vol.44 (1), p.104-147

1997

Volltextzugriff (PDF)

Tight analyses of two local load balancing algorithms

SIAM journal on computing, 2000, Vol.29 (1), p.29-64

2000

Volltextzugriff (PDF)

On the Benefit of Supporting Virtual Channels in Wormhole Routers

Journal of computer and system sciences, 2001-02, Vol.62 (1), p.152-177

2001

Volltextzugriff (PDF)

Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks: Fault-tolerant computing

IEEE transactions on computers, 1992, Vol.41 (5), p.578-587

1992

Volltextzugriff (PDF)

Real-time emulations of bounded-degree networks

Information processing letters, 1998-06, Vol.66 (5), p.269-276

1998

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

A Maximum Likelihood Stereo Algorithm

Improved routing and sorting on multibutterflies

An Experimental Analysis of Parallel Sorting Algorithms

On the Bisection Width and Expansion of Butterfly Networks

Sorting-based selection algorithms for hypercubic networks

On Balls and Bins with Deletions

A parallel algorithm for reconfiguring a multibutterfly network with faulty switches

On-line algorithms for path selection in a nonblocking network

Minimum-cost spanning tree as a path-finding problem

On the fault tolerance of some popular bounded-degree networks

Simple algorithms for routing on butterfly networks with bounded queues

Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks

Randomized Routing and Sorting on Fixed-Connection Networks

On the bisection width and expansion of butterfly networks

Protocols for Asymmetric Communication Channels

Invalidation Clues for Database Scalability Services

Reconfiguring arrays with faults. Part I: Worst-case faults

Tight Analyses of Two Local Load Balancing Algorithms

Real-time emulations of bounded-degree networks: Parallel models

Models of parallel computation: a survey and synthesis

Work-preserving emulations of fixed-connection networks

Tight analyses of two local load balancing algorithms

On the Benefit of Supporting Virtual Channels in Wormhole Routers

Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks: Fault-tolerant computing

Real-time emulations of bounded-degree networks

Suchergebnisse filtern