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...

Algorithms — ESA 2001: 9th Annual European Symposium Århus, Denmark, August 28–31, 2001 Proceedings

2001

Volltextzugriff (PDF)

Parallel Architectures and Their Efficient Use: First Heinz Nixdorf Symposium Paderborn, Germany, November 11–13, 1992 Proceedings

1993

Volltextzugriff (PDF)

Automata, Languages and Programming: 23rd International Colloquium, ICALP '96 Paderborn, Germany, July 8–12, 1996 Proceedings

1996

Volltextzugriff (PDF)

Smart Robot Teams Exploring Sparse Trees

Lecture notes in computer science, 2006, p.327-338

2006

Volltextzugriff (PDF)

Algorithms - ESA 2001: 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings

Meyer auf der Heide, Friedhelm

1, 2001

Volltextzugriff (PDF)

Algorithms for Sensor Systems: 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers

2013, 2013

Volltextzugriff (PDF)

Data Management in Networks: Experimental Evaluation of a Provably Good Strategy

Theory of computing systems, 2002, Vol.35 (2), p.217-245

2002

Volltextzugriff (PDF)

Optimal strategies for maintaining a chain of relays between an explorer and a base camp

Theoretical computer science, 2009-08, Vol.410 (36), p.3391-3405

2009

Volltextzugriff (PDF)

Static and dynamic data management in networks

Euro-Par'97 Parallel Processing, 2005, p.46-56

2005

Volltextzugriff (PDF)

Allocating Weighted Jobs in Parallel

Theory of computing systems, 1999-06, Vol.32 (3), p.281-300

1999

Volltextzugriff (PDF)

Dynamic perfect hashing: upper and lower bounds

SIAM journal on computing, 1994-08, Vol.23 (4), p.738-761

1994

Volltextzugriff (PDF)

Dynamic and Redundant Data Placement

27th International Conference on Distributed Computing Systems (ICDCS '07), 2007, p.29-29

2007

Volltextzugriff (PDF)

Automata, Languages and Programming: 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I

2010 edition., 2010

Volltextzugriff (PDF)

Automata, Languages and Programming: 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II

2010 edition., 2010

Volltextzugriff (PDF)

Dynamic data structures for realtime management of large geometric scenes

Lecture notes in computer science, 1997, p.157-170

1997

Volltextzugriff (PDF)

Minimal Solvers for Unsynchronized TDOA Sensor Network Calibration

9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS 2013),Sophia Antipolis, France,2013-09-05 - 2013-09-06, 2014, Vol.8243, p.95-110

2014

Volltextzugriff (PDF)

Provably Good and Practical Strategies for Non-uniform Data Management in Networks

Algorithms - ESA’ 99, 1999, p.89-100

1999

Volltextzugriff (PDF)

A time-space tradeoff for element distinctness

SIAM journal on computing, 1987-02, Vol.16 (1), p.97-99

1987

Volltextzugriff (PDF)

Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model

Theoretical computer science, 1998-08, Vol.203 (2), p.175-203

1998

Volltextzugriff (PDF)

Efficient PRAM simulation on a distributed memory machine

Algorithmica, 1996-10, Vol.16 (4-5), p.517-542

1996

Volltextzugriff (PDF)

Shortest-Path Routing in Arbitrary Networks

Journal of algorithms, 1999-04, Vol.31 (1), p.105-131

1999

Volltextzugriff (PDF)

Data management in hierarchical bus networks

ACM Symposium on Parallel Algorithms and Architectures: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures; 09-13 July 2000, 2000, p.109-118

2000

Volltextzugriff (PDF)

Communication efficient parallel searching

Lecture notes in computer science, 1997, p.233-254

1997

Volltextzugriff (PDF)

Routing on networks of optical crossbars: Parallel computing

Theoretical computer science, 1998, Vol.196 (1-2), p.181-200

1998

Volltextzugriff (PDF)

Improved optimal shared memory simulations, and the power of reconsideration

Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995, p.11-19

1995

Volltextzugriff (PDF)

1 – 25 von 177

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(154)
Mit Volltextzugriff
(175)

Publikationsform

Sprache

Englisch
(176)
Deutsch
(1)
Japanisch
(1)

Erscheinungsjahr

n.n

Thema

Computer Science
(150)
Science & Technology
(146)
Technology
(145)
Computer Science, Theory & Methods
(136)
Applied Sciences
(31)
Exact Sciences And Technology
(31)
Computer Science; Control Theory; Systems
(30)
Mathematics
(23)
Physical Sciences
(21)
Theoretical Computing
(21)
Algorithmics. Computability. Computer Arithmetics
(18)
Mathematics, Applied
(15)
Software
(14)
Algorithms
(13)
Computer Science, Information Systems
(8)
Online Algorithm
(8)
Competitive Ratio
(7)
Computer Systems And Distributed Systems. User Interface
(7)
Computers
(7)
Congresses
(7)

15 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

Algorithms — ESA 2001: 9th Annual European Symposium Århus, Denmark, August 28–31, 2001 Proceedings

Parallel Architectures and Their Efficient Use: First Heinz Nixdorf Symposium Paderborn, Germany, November 11–13, 1992 Proceedings

Automata, Languages and Programming: 23rd International Colloquium, ICALP '96 Paderborn, Germany, July 8–12, 1996 Proceedings

Smart Robot Teams Exploring Sparse Trees

Algorithms - ESA 2001: 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings

Algorithms for Sensor Systems: 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers

Data Management in Networks: Experimental Evaluation of a Provably Good Strategy

Optimal strategies for maintaining a chain of relays between an explorer and a base camp

Static and dynamic data management in networks

Allocating Weighted Jobs in Parallel

Dynamic perfect hashing: upper and lower bounds

Dynamic and Redundant Data Placement

Automata, Languages and Programming: 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I

Automata, Languages and Programming: 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II

Dynamic data structures for realtime management of large geometric scenes

Minimal Solvers for Unsynchronized TDOA Sensor Network Calibration

Provably Good and Practical Strategies for Non-uniform Data Management in Networks

A time-space tradeoff for element distinctness

Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model

Efficient PRAM simulation on a distributed memory machine

Shortest-Path Routing in Arbitrary Networks

Data management in hierarchical bus networks

Communication efficient parallel searching

Routing on networks of optical crossbars: Parallel computing

Improved optimal shared memory simulations, and the power of reconsideration

Suchergebnisse filtern