Search results for "Design and analysis of algorithms"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking	07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms.	Probabilistic Methods in the Design and Analysis of Algorithms	2007	DBLP BibTeX RDF
2	Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking (eds.)	Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007	Probabilistic Methods in the Design and Analysis of Algorithms	2007	DBLP BibTeX RDF
2	Chaitanya Swamy, David B. Shmoys	Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization.	Probabilistic Methods in the Design and Analysis of Algorithms	2007	DBLP BibTeX RDF
2	Bodo Manthey, Till Tantau	Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise.	Probabilistic Methods in the Design and Analysis of Algorithms	2007	DBLP BibTeX RDF
2	Michal Armoni	On the role of proofs in a course on design and analysis of algorithms.	SIGCSE Bulletin	2006	DBLP DOI BibTeX RDF	algorithms, correctness, proof
2	Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga	The Delayed k-Server Problem.	FCT	2005	DBLP DOI BibTeX RDF	approximation and randomized algorithms, Design and analysis of algorithms
2	Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough	A Faster and Simpler 2-Approximation Algorithm for Block Sorting.	FCT	2005	DBLP DOI BibTeX RDF	approximation algori- thms, block sorting, transposition sorting, optical character recognition, Design and analysis of algorithms
2	Yo-Sub Han, Derick Wood	A New Linearizing Restriction in the Pattern Matching Problem.	FCT	2005	DBLP DOI BibTeX RDF	string pattern matching, design and analysis of algorithms, Automata and formal languages
2	Amihood Amir, Oren Kapah, Dekel Tsur	Faster Two Dimensional Pattern Matching with Rotations.	CPM	2004	DBLP DOI BibTeX RDF	two dimensional pattern matching, rotation, Design and analysis of algorithms
2	Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps	Two-Dimensional Pattern Matching with Rotations.	CPM	2003	DBLP DOI BibTeX RDF	two-dimensional pattern matching, rotation, Design and analysis of algorithms
2	Revital Eres, Gad M. Landau, Laxmi Parida	A Combinatorial Approach to Automatic Discovery of Cluster-Patterns.	WABI	2003	DBLP DOI BibTeX RDF	data mining, clusters, patterns, discovery, Design and analysis of algorithms, motifs, combinatorial algorithms on words
2	Ryuhei Uehara	Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs.	ICALP	2002	DBLP DOI BibTeX RDF	Chordal bipartite graphs, lexicographic breadth first search, vertex elimination ordering, strongly chordal graphs, design and analysis of algorithms
2	Amihood Amir, Moshe Lewenstein, Ely Porat	Approximate Swapped Matching.	FSTTCS	2000	DBLP DOI BibTeX RDF	pattern matching with swaps, non-standard pattern matching, pattern matching, Design and analysis of algorithms, approximate pattern matching, combinatorial algorithms on words
2	Giuseppe F. Italiano, Rajiv Ramaswami	Maintaining Spanning Trees of Small Diameter.	Algorithmica	1998	DBLP DOI BibTeX RDF	Design and analysis of algorithms and data structures, Design and analysis of algorithms and data structures, Spanning trees, Spanning trees, Key words
1	Robert Endre Tarjan	Theory vs. Practice in the Design and Analysis of Algorithms.	WADS	2011	DBLP DOI BibTeX RDF
1	Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002, Asaf Levin	Finding mobile data under delay constraints with searching costs.	PODC	2010	DBLP DOI BibTeX RDF	partitioning and scheduling, approximation algorithms, design and analysis of algorithms
1	Shi-Qing Xin, Guo-Jin Wang	Improving Chen and Han's algorithm on the discrete geodesic problem.	ACM Trans. Graph.	2009	DBLP DOI BibTeX RDF	computational geometry, shortest path problems, Design and analysis of algorithms
1	Matteo Campanelli, Domenico Cantone, Simone Faro	A New Algorithm for Efficient Pattern Matching with Swaps.	IWOCA	2009	DBLP DOI BibTeX RDF	empattern matching with swaps, nonstandard pattern matching, design and analysis of algorithms, combinatorial algorithms on words
1	Domenico Cantone, Simone Faro	Pattern Matching with Swaps for Short Patterns in Linear Time.	SOFSEM	2009	DBLP DOI BibTeX RDF	pattern matching with swaps, nonstandard pattern matching, design and analysis of algorithms, combinatorial algorithms on words
1	Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat	Real Two Dimensional Scaled Matching.	Algorithmica	2009	DBLP DOI BibTeX RDF	Scaled pattern matching, Generalized pattern matching, Pattern matching, Design and analysis of algorithms, Approximate pattern matching, Combinatorial algorithms on words
1	Nikos Vlassis, Marc Toussaint	Model-free reinforcement learning as mixture learning.	ICML	2009	DBLP DOI BibTeX RDF
1	David L. Millman, Jack Snoeyink	Computing the Implicit Voronoi Diagram in Triple Precision.	WADS	2009	DBLP DOI BibTeX RDF	Low-degree primitives, Robust computation, Randomized algorithm, Voronoi diagram
1	Jiong Guo, Rolf Niedermeier, Daniel Raible	Improved Algorithms and Complexity Results for Power Domination in Graphs.	Algorithmica	2008	DBLP DOI BibTeX RDF	Graphs of bounded treewidth, (Power) domination in graphs, Computational complexity, Graph algorithms, Parameterized complexity, Design and analysis of algorithms, Fixed-parameter algorithms
1	Xi Chen, Xiaotie Deng	Matching algorithmic bounds for finding a Brouwer fixed point.	J. ACM	2008	DBLP DOI BibTeX RDF	Approximate fixed point, Sperner's lemma, fixed point theorem, Lipschitz function
1	Irene Finocchi, Giuseppe F. Italiano	Sorting and Searching in Faulty Memories.	Algorithmica	2008	DBLP DOI BibTeX RDF	Memory faults, Computing with unreliable information, Searching, Sorting, Memory models, Combinatorial algorithms
1	Alberto Apostolico, Claudia Tagliacollo	Optimal Offline Extraction of Irredundant Motif Bases.	COCOON	2007	DBLP DOI BibTeX RDF	Irredundant Motif, Pattern Matching, Design and Analysis of Algorithms, Motif Discovery, Basis
1	Qin Xin	Faster Treasure Hunt and Better Strongly Universal Exploration Sequences.	ISAAC	2007	DBLP DOI BibTeX RDF	strongly universal exploration sequences, networks, distributed computing, rendezvous, design and analysis of algorithms
1	Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu	Efficient algorithms for finding a longest common increasing subsequence.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Longest common increasing subsequence, Design and analysis of algorithms
1	Abraham D. Flaxman, Alan M. Frieze, Juan Vera	A Geometric Preferential Attachment Model of Networks II.	WAW	2007	DBLP DOI BibTeX RDF
1	Franco P. Preparata	Beware of the Model: Reflections on Algorithmic Research.	CIAC	2006	DBLP DOI BibTeX RDF
1	Johannes Köbler	On Graph Isomorphism for Restricted Graph Classes.	CiE	2006	DBLP DOI BibTeX RDF
1	Donald D. Chinn	Peer assessment in the algorithms course.	ITiCSE	2005	DBLP DOI BibTeX RDF	collaborative learning, design and analysis of algorithms, peer assessment
1	Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack	Determining approximate shortest paths on weighted polyhedral surfaces.	J. ACM	2005	DBLP DOI BibTeX RDF	weighted paths, approximation algorithms, computational geometry, shortest path problems, Design and analysis of algorithms, polyhedral surfaces
1	Xi Chen, Xiaotie Deng	On algorithms for discrete and approximate brouwer fixed points.	STOC	2005	DBLP DOI BibTeX RDF	Sperner's lemma, approximate fixed point, fixed point theorem, Lipschitz function
1	Grace J. Hwang, Joseph Arul, Eric Lin, Chung-Yun Hung	Design and Multithreading Implementation of the Wave-Front Algorithm for Constructing Voronoi Diagrams.	ICA3PP	2005	DBLP DOI BibTeX RDF
1	William Fahle	Review of "Introduction to the Design and Analysis of Algorithms by Ananay Levitin", Addison-Wesley.	SIGACT News	2004	DBLP DOI BibTeX RDF
1	Gabriel Valiente	On the Algorithm of Berztiss for Tree Pattern Matching.	ENC	2004	DBLP DOI BibTeX RDF	subtree isomorphism, combinatorial problems, design and analysis of algorithms, tree pattern matching
1	Reuven Bar-Yehuda, Keren Bendel, Ari Freund, Dror Rawitz	Local ratio: A unified framework for approxmation algrithms in memoriam: Shimon Even 1935-2004.	ACM Comput. Surv.	2004	DBLP DOI BibTeX RDF	fractional local ratio, local ratio technique, Approximation algorithms
1	Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano	Engineering and Visualizing Algorithms.	Graph Drawing	2003	DBLP DOI BibTeX RDF
1	Naoki Abe, Alan W. Biermann, Philip M. Long	Reinforcement Learning with Immediate Rewards and Linear Hypotheses.	Algorithmica	2003	DBLP DOI BibTeX RDF	Immediate rewards, Reinforcement learning, Online algorithms, Online learning, Decision theory, Dialogue systems, Computational learning theory
1	Anany Levitin, Mary-Angela Papalaskari	Using puzzles in teaching algorithms.	SIGCSE	2002	DBLP DOI BibTeX RDF
1	Peter Sanders	Reconciling simplicity and realism in parallel disk models.	SODA	2001	DBLP DOI BibTeX RDF
1	Anany Levitin	Design and analysis of algorithms reconsidered.	SIGCSE	2000	DBLP DOI BibTeX RDF
1	Camil Demetrescu, Giuseppe F. Italiano	What Do We Learn from Experimental Algorithmics?	MFCS	2000	DBLP DOI BibTeX RDF
1	Charles E. Leiserson	Design and Analysis of Algorithms for Shared-Memory Multiprocessors (Abstract).	WADS	1999	DBLP DOI BibTeX RDF
1	Haim Kaplan, Ron Shamir	Bounded Degree Interval Sandwich Problems.	Algorithmica	1999	DBLP DOI BibTeX RDF	Parametrized complexity, Computational biology, Interval graphs, Design and analysis of algorithms
1	Edward M. Reingold	Basic Techniques for Design and Analysis of Algorithms.	The Computer Science and Engineering Handbook	1997	DBLP BibTeX RDF
1	Edward M. Reingold	Basic Techniques for Design and Analysis of Algorithms.	ACM Comput. Surv.	1996	DBLP DOI BibTeX RDF
1	Alexandros V. Gerbessiotis, Constantinos J. Siniolakis	Communication Efficient Data Structures on the BSP Model with Applications in Computational Geometry.	Euro-Par, Vol. II	1996	DBLP DOI BibTeX RDF
1	Jonathan M. Nash, Peter M. Dew, John R. Davy, Martin E. Dyer	Implementation Issues Relating to the WPRAM Model for Scalable Computing.	Euro-Par, Vol. II	1996	DBLP DOI BibTeX RDF
1	Josyula R. Rao	Reasoning about Probabilistic Parallel Programs.	ACM Trans. Program. Lang. Syst.	1994	DBLP DOI BibTeX RDF	verification, parallel programming, probabilistic algorithms, correctness proofs, programming methodology, specification techniques
1	Dexter Kozen	Design and analysis of algorithms.		1992	RDF
1	Dexter Kozen	On Kleene Algebras and Closed Semirings.	MFCS	1990	DBLP DOI BibTeX RDF
1	Jeffrey D. Smith	Design and analysis of algorithms.		1989	RDF
1	Yung H. Tsin	Finding Lowest Common Ancestors in Parallel.	IEEE Trans. Computers	1986	DBLP DOI BibTeX RDF	SIMD models, fundamental cycles, parallel computation, PRAM, Design and analysis of algorithms, parallel graph algorithms, lowest common ancestors
1	Hartmut Schmeck, Heiko Schröder	Dictionary Machines for Different Models of VLSI.	IEEE Trans. Computers	1985	DBLP DOI BibTeX RDF	VLSI hardware models, Dictionary machines. are taken as an example to demonstrate the implications the choice of the VLSI hardware model has on the design and analysis of algorithms and special purpose architectures, A systolic search tree and a two-dimensional systolic array are used to implement the dictionary machine, If the wire lengths only affect the area, the systolic search tree suggests itself as an efficient realization of a dictionary machine having constant period, linear areS and logarithmic execution t, Algorithms for VLSI, systolic search tree, systolic array, VLSI complexity, dictionary machine
1	Bernd Mahr	A Birds Eye View to Path Problems.	WG	1980	DBLP DOI BibTeX RDF