UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Secure spread spectrum watermarking for multimedia

IEEE transactions on image processing, 1997-12, Vol.6 (12), p.1673-1687

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)

Hamming Codes, Hypercube Embeddings, and Fault Tolerance

SIAM journal on computing, 2007-01, Vol.37 (3), p.783-803

2007

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)

Drawing graphs in the plane with high resolution

SIAM journal on computing, 1993-10, Vol.22 (5), p.1035-1052

1993

Volltextzugriff (PDF)

Work-preserving emulations of fixed-connection networks

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

1997

Volltextzugriff (PDF)

Graph bisection algorithms with good average case behavior

Combinatorica (Budapest. 1981), 1987-06, Vol.7 (2), p.171-191

1987

Volltextzugriff (PDF)

Processor-ring communication : A tight asymptotic bound on packet waiting times

SIAM journal on computing, 1998-10, Vol.27 (5), p.1221-1236

1998

Volltextzugriff (PDF)

Dynamic tree embeddings in butterflies and hypercubes

SIAM journal on computing, 1992-08, Vol.21 (4), p.639-654

1992

Volltextzugriff (PDF)

First-fit allocation of queues: tight probabilistic bounds on wasted space

Stochastic processes and their applications, 1990-12, Vol.36 (2), p.311-330

1990

Volltextzugriff (PDF)

HAMMING CODES, HYPERCUBE EMBEDDINGS, AND FAULT TOLERANCE

SIAM journal on computing, 2008, Vol.37 (3), p.783-803

2008

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)

Tight analyses of two local load balancing algorithms

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

2000

Volltextzugriff (PDF)

Circulants and the Characterization of Vertex-Transitive Graphs

Journal of research of the National Bureau of Standards (1977), 1983-11, Vol.88 (6), p.395-402

Leighton, F.T.

1983

Volltextzugriff (PDF)

On the Decomposition of Vertex-Transitive Graphs into Multicycles

Journal of research of the National Bureau of Standards (1977), 1983-11, Vol.88 (6), p.403-410

Leighton, F.T.

1983

Volltextzugriff (PDF)

Comparing queues and stacks as mechanisms for laying out graphs

SIAM journal on discrete mathematics, 1992-08, Vol.5 (3), p.398-412

1992

Volltextzugriff (PDF)

Scheduling Tree-Dags Using FIFO Queues: A Control–Memory Trade-Off

Journal of parallel and distributed computing, 1996-02, Vol.33 (1), p.55-68

1996

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)

Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory

SIAM journal on scientific computing, 1994-05, Vol.15 (3), p.713-735

1994

Volltextzugriff (PDF)

Optimal emulations by butterfly-like networks

Journal of the ACM, 1996-03, Vol.43 (2), p.293-330

1996

Volltextzugriff (PDF)

Randomized Routing and Sorting on Fixed-Connection Networks

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

1994

Volltextzugriff (PDF)

Packet routing and job-shop scheduling inO(congestion+dilation) steps

Combinatorica (Budapest. 1981), 1994-06, Vol.14 (2), p.167-186

1994

Volltextzugriff (PDF)

A provably efficient algorithm for dynamic storage allocation

Journal of computer and system sciences, 1989-02, Vol.38 (1), p.2-35

1989

Volltextzugriff (PDF)

Global wire routing in two-dimensional arrays

Algorithmica, 1987-11, Vol.2 (1-4), p.113-129

1987

Volltextzugriff (PDF)

Resistance of digital watermarks to collusive attacks

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), 1998, p.271

1998

Volltextzugriff (PDF)

1 – 25 von 1.326

Menü

Weitere Dienste

Einstellungen

Secure spread spectrum watermarking for multimedia

Tight Analyses of Two Local Load Balancing Algorithms

Hamming Codes, Hypercube Embeddings, and Fault Tolerance

On-line algorithms for path selection in a nonblocking network

Drawing graphs in the plane with high resolution

Work-preserving emulations of fixed-connection networks

Graph bisection algorithms with good average case behavior

Processor-ring communication : A tight asymptotic bound on packet waiting times

Dynamic tree embeddings in butterflies and hypercubes

First-fit allocation of queues: tight probabilistic bounds on wasted space

HAMMING CODES, HYPERCUBE EMBEDDINGS, AND FAULT TOLERANCE

On the fault tolerance of some popular bounded-degree networks

Tight analyses of two local load balancing algorithms

Circulants and the Characterization of Vertex-Transitive Graphs

On the Decomposition of Vertex-Transitive Graphs into Multicycles

Comparing queues and stacks as mechanisms for laying out graphs

Scheduling Tree-Dags Using FIFO Queues: A Control–Memory Trade-Off

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

Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory

Optimal emulations by butterfly-like networks

Randomized Routing and Sorting on Fixed-Connection Networks

Packet routing and job-shop scheduling inO(congestion+dilation) steps

A provably efficient algorithm for dynamic storage allocation

Global wire routing in two-dimensional arrays

Resistance of digital watermarks to collusive attacks

Suchergebnisse filtern