Search results for "Algorithm engineering"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Matthias Müller-Hannemann, Stefan Schirra	Foundations of Algorithm Engineering.	Algorithm Engineering	2010	DBLP DOI BibTeX RDF
3	Matthias Müller-Hannemann, Stefan Schirra	Challenges in Algorithm Engineering.	Algorithm Engineering	2010	DBLP DOI BibTeX RDF
3	Gianfranco Bilardi, Paolo D'Alberto, Alexandru Nicolau	Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
3	William F. McColl	BSP Algorithms - Write Once, Run Anywhere.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
3	Nadav Eiron, Michael Rodeh, Iris Steinwarts	Matrix Multiplication: A Case Study of Algorithm Engineering.	Algorithm Engineering	1998	DBLP BibTeX RDF
2	Peter Sanders	Algorithm Engineering - An Attempt at a Definition Using Sorting as an Example.	ALENEX	2010	DBLP BibTeX RDF
2	Matthias Müller-Hannemann, Stefan Schirra (eds.)	Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar]	Algorithm Engineering	2010	DBLP BibTeX RDF
2	Roman Dementiev, Johannes Singler	Libraries.	Algorithm Engineering	2010	DBLP DOI BibTeX RDF
2	Eric Berberich, Matthias Hagen, Benjamin Hiller, Hannes Moser	Experiments.	Algorithm Engineering	2010	DBLP DOI BibTeX RDF
2	Marc Mörig, Sven Scholz, Tobias Tscheuschner, Eric Berberich	Implementation Aspects.	Algorithm Engineering	2010	DBLP DOI BibTeX RDF
2	Sabine Helwig, Falk Hüffner, Ivo Rössling, Maik Weinard	Selected Design Issues.	Algorithm Engineering	2010	DBLP DOI BibTeX RDF
2	Heiner Ackermann, Heiko Röglin, Ulf Schellbach, Nils Schweer	Analysis of Algorithms.	Algorithm Engineering	2010	DBLP DOI BibTeX RDF
2	Daniel Delling, Roberto Hoffmann, Maria Kandyba, Anna Schulze	Case Studies.	Algorithm Engineering	2010	DBLP DOI BibTeX RDF
2	Markus Geyer, Benjamin Hiller, Sascha Meinert	Modeling.	Algorithm Engineering	2010	DBLP DOI BibTeX RDF
2	Deepak Ajwani, Henning Meyerhenke	Realistic Computer Models.	Algorithm Engineering	2010	DBLP DOI BibTeX RDF
2	Peter Sanders	Algorithm Engineering - An Attempt at a Definition.	Efficient Algorithms	2009	DBLP DOI BibTeX RDF
2	Prasanna Balaprakash, Mauro Birattari, Thomas Stützle	Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem.	Recent Advances in Evolutionary Computation for Combinatorial Optimization	2008	DBLP DOI BibTeX RDF	Stochastic Optimization Problems, Probabilistic Travelling Salesman Problem, Estimation-Based Local Search, Algorithm Engineering, Stochastic Local Search
2	Mihhail Aizatulin, Florian Diedrich, Klaus Jansen	Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem.	WEA	2006	DBLP DOI BibTeX RDF	Evaluation and Fine-tuning, Testing, Implementation, Mathematical Programming, Algorithm Engineering
2	Krists Boitmanis, Karlis Freivalds, Peteris Ledins, Rudolfs Opmanis	Fast and Simple Approximation of the Diameter and Radius of a Graph.	WEA	2006	DBLP DOI BibTeX RDF	graph diameter, graph algorithms, analysis of algorithms, algorithm engineering, approximation techniques
2	David A. Bader	High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology.	WEA	2005	DBLP DOI BibTeX RDF
2	Guojing Cong, David A. Bader	Lock-Free Parallel Algorithms: An Experimental Study.	HiPC	2004	DBLP DOI BibTeX RDF	Lock-free Data Structures, High-Performance Algorithm Engineering, Parallel Algorithms, Shared Memory
2	David A. Bader, Sukanya Sreshta, Nina R. Weisse-Bernstein	Evaluating Arithmetic Expressions Using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs) (Extended Abstract).	HiPC	2002	DBLP DOI BibTeX RDF	High-Performance Algorithm Engineering, Shared Memory, Parallel Graph Algorithms, Expression Evaluation, Tree Contraction
2	Bernard M. E. Moret, David A. Bader, Tandy Warnow	High-Performance Algorithm Engineering for Computational Phylogenetics.	International Conference on Computational Science	2001	DBLP DOI BibTeX RDF
2	Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel	Graph Drawing Algorithm Engineering with AGD.	Software Visualization	2001	DBLP DOI BibTeX RDF
2	Walter Willinger	New Algorithmic Challenges Arising in Measurement-Driven Networking Research.	ALENEX	2001	DBLP DOI BibTeX RDF
2	Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma	Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
2	Matthias Müller-Hannemann, Karsten Weihe	Pareto Shortest Paths is Often Feasible in Practice.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF	railway networks, shortest paths, Multi-criteria optimization, Pareto set
2	Gonzalo Navarro, Mathieu Raffinot	Compact DFA Representation for Fast Regular Expression Search.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
2	Kazuo Iwama, Suguru Tamaki	Exploiting Partial Knowledge of Satisfying Assignments.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
2	Naila Rahman, Richard Cole, Rajeev Raman	Optimised Predecessor Data Structures for Internal Memory.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
2	Hervé Brönnimann	Designing and Implementing a General Purpose Halfedge Data Structure.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
2	Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzon	The Max-Shift Algorithm for Approximate String Matching.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF	dynamic programming, edit-distance, approximate string matching, String algorithms
2	Eric J. Anderson, Joseph Hall, Jason D. Hartline, Michael Hobbs, Anna R. Karlin, Jared Saia, Ram Swaminathan, John Wilkes	An Experimental Study of Data Migration Algorithms.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
2	Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Nearchos Paspallis, Paul G. Spirakis, Christos D. Zaroliagis	An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
2	Christopher L. Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist	Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
2	Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel	An Adaptable and Extensible Geometry Kernel.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF	library design, Computational geometry, generic programming
2	Arne Andersson, Per Carlsson, Fredrik Ygge	Efficient Resource Allocation with Noisy Functions.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
2	David A. Bader, Ajith K. Illendula, Bernard M. E. Moret, Nina R. Weisse-Bernstein	Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
2	Jyrki Katajainen, Bjarke Buur Mortensen	Experiences with the Design and Implementation of Space-Efficient Deques.	Algorithm Engineering	2001	DBLP DOI BibTeX RDF
2	David A. Bader, Bernard M. E. Moret, Peter Sanders	Algorithm Engineering for Parallel Computation.	Experimental Algorithmics	2000	DBLP DOI BibTeX RDF
2	Paul G. Spirakis, Christos D. Zaroliagis	Distributed Algorithm Engineering.	Experimental Algorithmics	2000	DBLP DOI BibTeX RDF
2	Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher	Visualization in Algorithm Engineering: Tools and Techniques.	Experimental Algorithmics	2000	DBLP DOI BibTeX RDF
2	Thomas Erlebach, Klaus Jansen	Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni	Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto	Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Javed A. Aslam, Alain Leblanc, Clifford Stein	Clustering Data without Prior Knowledge.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis	Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Werner Backes, Susanne Wetzel	Lattice Basis Reduction with Dynamic Approximation.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Annegret Liebers, Karsten Weihe	Recognizing Bundles in Time Table Graphs - A Structural Approach.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano	New Algorithms for Examination Timetabling.	Algorithm Engineering	2000	DBLP BibTeX RDF
2	Isabelle Guérin Lassous, Jens Gustedt	Portable List Ranking: An Experimental Study.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Susanne Albers, Bianca Schröder	An Experimental Study of Online Scheduling Algorithms.	Algorithm Engineering	2000	DBLP BibTeX RDF
2	Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Rajiv Wickremesinghe	Efficient Sorting Using Registers and Caches.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Peter Sanders, Rudolf Fleischer	Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Jan Vahrenhold, Klaus Hinrichs	Planar Point Location for Large Data Sets: To Seek or Not to Seek.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Camil Demetrescu, Irene Finocchi, Giuseppe Liotta	Visualizing Algorithms over the Web with the Publication-Driven Approach.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Karsten Weihe	On the Differences between ``Practical'' and ``Applied''.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Iddo Hanniel, Dan Halperin	Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Guido Proietti	Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Stefan Edelkamp, Patrick Stiegeler	Pushing the Limits in Sequential Sorting.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Jesper Bojesen, Jyrki Katajainen	Interchanging Two Segments of an Array in a Hierarchical Memory System.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Kurt Mehlhorn, Guido Schäfer	Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures.	Algorithm Engineering	2000	DBLP DOI BibTeX RDF
2	Panagiota Fatourou, Paul G. Spirakis, Panagiotis Zarafidis, Anna Zoura	Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Fred Glover, Gregory Gutin, Anders Yeo, Alexey Zverovich	Construction Heuristics and Domination Analysis for the Asymmetric TSP.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Kurt Mehlhorn	Ten Years of LEDA Some Thoughts (Abstract).	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Jesper Bojesen, Jyrki Katajainen, Maz Spork	Performance Engineering Case Study: Heap Construction.	Algorithm Engineering	1999	DBLP BibTeX RDF
2	Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart	On-Line Zone Construction in Arrangements of Lines in the Plane.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Andreas Crauser, Kurt Mehlhorn	LEDA-SM Extending LEDA to Secondary Memory.	Algorithm Engineering	1999	DBLP BibTeX RDF
2	Renato Fonseca F. Werneck, João C. Setubal, Arlindo Flávio da Conceição	Finding Minimum Congestion Spanning Trees.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Gonzalo Navarro, Mathieu Raffinot	Fast Regular Expression Search.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Athanasios Bouganis, Ioannis Caragiannis, Christos Kaklamanis	Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks.	Algorithm Engineering	1999	DBLP BibTeX RDF
2	Robert Giegerich, Stefan Kurtz, Jens Stoye	Efficient Implementation of Lazy Suffix Trees.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Massimiliano Caramia, Paolo Dell'Olmo	A Fast and Simple Local Search for Graph Coloring.	Algorithm Engineering	1999	DBLP BibTeX RDF
2	Naila Rahman, Rajeev Raman	Analysing Cache Effects in Distribution Sorting.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Michael L. Fredman	A Priority Queue Transform.	Algorithm Engineering	1999	DBLP BibTeX RDF
2	Shlomit Dascal, Uzi Vishkin	Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Basil Tampakas	Counting in Mobile Networks: Theory and Experimentation.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Jochen Comes, Mark Ziegelmann	An Easy to Use Implementation of Linear Perturbations within CGAL.	Algorithm Engineering	1999	DBLP BibTeX RDF
2	Maureen Korda, Rajeev Raman	An Experimental Evaluation of Hybrid Data Structures for Searching.	Algorithm Engineering	1999	DBLP BibTeX RDF
2	Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lenhof	BALL: Biochemical Algorithms Library.	Algorithm Engineering	1999	DBLP BibTeX RDF
2	Frank Schulz, Dorothea Wagner, Karsten Weihe	Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Andrew V. Goldberg	Selecting Problems for Algorithm Evaluation.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Dimitris J. Kavvadias, Elias C. Stavropoulos	Evaluation of an Algorithm for the Transversal Hypergraph Problem.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer	An Experimental Study of Priority Queues in External Memory.	Algorithm Engineering	1999	DBLP BibTeX RDF
2	Víctor M. Jiménez, Andrés Marzal	Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Sabine Hanke	The Performance of Concurrent Red-Black Tree Algorithms.	Algorithm Engineering	1999	DBLP BibTeX RDF
2	Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan	The Design and Implementation of Planar Maps in CGAL.	Algorithm Engineering	1999	DBLP DOI BibTeX RDF
2	Daniel H. Huson, Kelly Ann Smith, Tandy Warnow	Estimating Large Distances in Phylogenetic Reconstruction.	Algorithm Engineering	1999	DBLP BibTeX RDF
2	Kurt Mehlhorn (eds.)	Algorithm Engineering, 2nd International Workshop, WAE '92, Saarbrücken, Germany, August 20-22, 1998, Proceedings	Algorithm Engineering	1998	DBLP BibTeX RDF
2	John D. Kececioglu, A. Justin Pecqueur	Computing Maximum-Cardinality Matchings in Sparse General Graphs.	Algorithm Engineering	1998	DBLP BibTeX RDF
2	Matthias Müller-Hannemann, Alexander Schwartz	Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design.	Algorithm Engineering	1998	DBLP BibTeX RDF
2	Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan	Computing the Width of a Three-Dimensional Point Set: An Experimental Study.	Algorithm Engineering	1998	DBLP BibTeX RDF
2	Torben Hagerup, Peter Sanders, Jesper Larsson Träff	An Implementation of the Binary Blocking Flow Algorithm.	Algorithm Engineering	1998	DBLP BibTeX RDF
2	Riko Jacob, Madhav V. Marathe, Kai Nagel	A Computational Study of Routing Algorithms for Realistic Transportation Networks.	Algorithm Engineering	1998	DBLP BibTeX RDF
2	Daniel H. Huson, Scott Nettles, Kenneth Rice, Tandy Warnow, Shibu Yooseph	Hybrid Tree Reconstruction Methods.	Algorithm Engineering	1998	DBLP BibTeX RDF
2	John R. Black, Charles U. Martel, Hongbin Qi	Graph and Hashing Algorithms for Modern Architectures: Design and Performance.	Algorithm Engineering	1998	DBLP BibTeX RDF
2	Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels	Guarding Scenes against Invasive Hypercubes.	Algorithm Engineering	1998	DBLP BibTeX RDF
2	Stefan Nilsson, Matti Tikkanen	Implementing a Dynamic Compressed Trie.	Algorithm Engineering	1998	DBLP BibTeX RDF
2	Thomas Erlebach, Klaus Jansen	Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks.	Algorithm Engineering	1998	DBLP BibTeX RDF
2	Steven Skiena	Who is Interested in Algorithms and why? Lessons from the Stony Brook Algorithms Repository.	Algorithm Engineering	1998	DBLP BibTeX RDF