Search results for "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	Péter Balázs	On the Number of hv-Convex Discrete Sets.	IWCIA	2008	DBLP DOI BibTeX RDF	hv-convex discrete set, analysis of algorithms, connectedness, discrete tomography
2	Loïck Lhote, Brigitte Vallée	Gaussian Laws for the Main Parameters of the Euclid Algorithms.	Algorithmica	2008	DBLP DOI BibTeX RDF	Euclid’s algorithms, Distributional analysis, Transfer operator, Asymptotic Gaussian laws, Tauberian theorems, Perron’s formula, Dynamical analysis of algorithms, Dynamical systems, Analysis of algorithms, Average-case analysis
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	Jiri Stastny, Vladislav Skorpil	Analysis of Algorithms for Radial Basis Function Neural Network.	PWC	2007	DBLP DOI BibTeX RDF	Radial basis function, Learning algorithm, Neuron, Hidden layer
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	Péter Balázs	Generation and Empirical Investigation of hv -Convex Discrete Sets.	SCIA	2007	DBLP DOI BibTeX RDF	hv-convex discrete set, decomposable configuration, analysis of algorithms, discrete tomography, random generation
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	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	Jeff Hartline, Alexa Sharp	An Incremental Model for Combinatorial Maximization Problems.	WEA	2006	DBLP DOI BibTeX RDF	online problems, analysis of algorithms, network analysis, combinatorial problems, approximation techniques
2	Daniel A. Spielman	The Smoothed Analysis of Algorithms.	FCT	2005	DBLP DOI BibTeX RDF
2	Anany Levitin	Analyze that: puzzles and analysis of algorithms.	SIGCSE	2005	DBLP DOI BibTeX RDF	pedagogy, algorithm analysis, puzzles
2	Marek Chrobak, Claire Kenyon, Neal E. Young	The Reverse Greedy Algorithm for the Metric K-Median Problem.	COCOON	2005	DBLP DOI BibTeX RDF	approximation algorithms, online algorithms, Analysis of algorithms
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	Daniel A. Spielman, Shang-Hua Teng	Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time.	J. ACM	2004	DBLP DOI BibTeX RDF	complexity, perturbation, Simplex method, smoothed analysis
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	Refael Hassin, Shlomi Rubinstein	An Approximation Algorithm for Maximum Triangle Packing.	ESA	2004	DBLP DOI BibTeX RDF	maximum triangle packing, 2-edge paths, 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	Ian Sanders	Teaching empirical analysis of algorithms.	SIGCSE	2002	DBLP DOI BibTeX RDF
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	Helger Lipmaa	On Optimal Hash Tree Traversal for Interval Time-Stamping.	ISC	2002	DBLP DOI BibTeX RDF	interval time-stamping, Laplace's method for integrals, Analysis of algorithms, tree traversal, implementation complexity
2	Daniel A. Spielman, Shang-Hua Teng	Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time.	STOC	2001	DBLP DOI BibTeX RDF
2	Yuriy A. Reznik, Wojciech Szpankowski	On the Average Redundancy Rate of the Lempel-Ziv Code with K-Error Protocol.	Data Compression Conference	2000	DBLP DOI BibTeX RDF	Lempel-Ziv parsing scheme, k-error protocol, generalized digital search trees, analytical analysis of algorithms, data compression, error propagation
2	Sebastiano Battiato, Domenico Cantone, Dario Catalano, Gianluca Cincotti, Micha Hofri	An Efficient Algorithm for the Approximate Median Selection Problem.	CIAC	2000	DBLP DOI BibTeX RDF	in-place algorithms, median selection, Approximation algorithms, analysis of algorithms
2	Domenico Cantone, Gianluca Cincotti	QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms.	CIAC	2000	DBLP DOI BibTeX RDF	In-place sorting, heapsort, analysis of algorithms, quicksort
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	Helmut Prodinger, Wojciech Szpankowski	Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics.	Algorithmica	1998	DBLP DOI BibTeX RDF	Digital sums, Rice's method, Trees, Generating functions, Continued fractions, Random generation, Singularity analysis, Mellin transform, Limit distribution
2	Greg N. Frederickson	Maintaining Regular Properties Dynamically in k-Terminal Graphs.	Algorithmica	1998	DBLP DOI BibTeX RDF	Dynamic graph operation, k -Terminal graph, Tree-decomposable graph, t -Topology tree. Key words, Dynamic graph operation, k -Terminal graph, Tree-decomposable graph, t -Topology tree, Data structures, Data structures, Analysis of algorithms, Analysis of algorithms
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
2	Darrah Chavey	Songs and the analysis of algorithms.	SIGCSE	1996	DBLP DOI BibTeX RDF
2	Philippe Flajolet	Analytic Analysis of Algorithms.	ICALP	1992	DBLP DOI BibTeX RDF
2	Ricardo A. Baeza-Yates, Gaston H. Gonnet	Average Case Analysis of Algorithms using Matrix Recurrences.	ICCI	1990	DBLP DOI BibTeX RDF	average case, digital trees, matrix recurrences, Analysis of algorithms, search trees
1	Floris Ernst, Ralf Bruder, Alexander Schlaefer, Achim Schweikard	Forecasting pulsatory motion for non-invasive cardiac radiosurgery: an analysis of algorithms from respiratory motion prediction.	Int. J. Computer Assisted Radiology and Surgery	2011	DBLP DOI BibTeX RDF
1	Matthew Ruffalo, Thomas LaFramboise, Mehmet Koyutürk	Comparative analysis of algorithms for next-generation sequencing read alignment.	Bioinformatics	2011	DBLP DOI BibTeX RDF
1	Mladen Miksa	Review of mathematics for the analysis of algorithms by Daniel H. Greene and Donald E. Knuth.	SIGACT News	2011	DBLP DOI BibTeX RDF
1	Bodo Manthey, Heiko Röglin	Smoothed Analysis: Analysis of Algorithms Beyond Worst Case.	it - Information Technology	2011	DBLP DOI BibTeX RDF
1	Robert Endre Tarjan	Theory vs. Practice in the Design and Analysis of Algorithms.	WADS	2011	DBLP DOI BibTeX RDF
1	Stephan Sigg, Rayan Merched El Masri, Michael Beigl	Feedback-Based Closed-Loop Carrier Synchronization: A Sharp Asymptotic Bound, an Asymptotically Optimal Approach, Simulations, and Experiments.	IEEE Trans. Mob. Comput.	2011	DBLP DOI BibTeX RDF	wireless sensor networks, wireless communication, Analysis of algorithms
1	Ulrich Laube, Markus E. Nebel	Maximum likelihood analysis of algorithms and data structures.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Daniele Gallo, Carmine Landi, Mario Luiso	Accuracy Analysis of Algorithms Adopted in Voltage Dip Measurements.	IEEE T. Instrumentation and Measurement	2010	DBLP DOI BibTeX RDF
1	Heiner Ackermann, Heiko Röglin, Ulf Schellbach, Nils Schweer	Analysis of Algorithms.	Algorithm Engineering	2010	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	Juliano B. Lima, Daniel Panario, Qiang Wang	A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form.	IEEE Trans. Computers	2010	DBLP DOI BibTeX RDF	computations on polynomials, Theory of computation, analysis of algorithms and problem complexity
1	Mahmoud Al-Ayyoub, Himanshu Gupta	Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models.	IEEE Trans. Mob. Comput.	2010	DBLP DOI BibTeX RDF	Network protocols, analysis of algorithms and problem complexity
1	Darrah Chavey	Double sorting: testing their sorting skills.	SIGCSE	2010	DBLP DOI BibTeX RDF	cs1, sorting, selection, insertion, quicksort
1	R. Gopalan, N. S. Narayanaswamy	Analysis of algorithms for an online version of the convoy movement problem.	JORS	2009	DBLP DOI BibTeX RDF
1	He Lijun, Li Linghua, Li Xiaoniu, Wang Degao	Comparison and Analysis of Algorithms for Association Rules.	DBTA	2009	DBLP DOI BibTeX RDF
1	Zhi-Ying Yang, Jun-Liang Chen	The Simulation and Analysis of Algorithms for Redundant Reader Elimination in RFID System.	EMS	2009	DBLP DOI BibTeX RDF
1	Cheng-Mu Shiao, Ruey-Rong Su, I-Shyan Hwang, Bor-Jiunn Hwang	Performance Analysis of Algorithms with Multiple Attributes for Adaptive Call Admission Control in Heterogeneous Wireless Networks.	ISPAN	2009	DBLP DOI BibTeX RDF	Call admission control strategy, QoS, System performance, Heterogeneous wireless networks
1	Florin Leon, Bogdan Ioan Aignatoaiei, Mihai Horia Zaharia	Performance Analysis of Algorithms for Protein Structure Classification.	DEXA Workshops	2009	DBLP DOI BibTeX RDF
1	Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham	Empirical hardness models: Methodology and a case study on combinatorial auctions.	J. ACM	2009	DBLP DOI BibTeX RDF	Empirical analysis of algorithms, algorithm portfolios, runtime prediction, combinatorial auctions
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	Joel I. Seiferas	Sorting Networks of Logarithmic Depth, Further Simplified.	Algorithmica	2009	DBLP DOI BibTeX RDF	Comparison network, Oblivious sorting, Analysis of algorithms, Sorting network, Parallel sorting, Comparator network
1	Nikos Vlassis, Marc Toussaint	Model-free reinforcement learning as mixture learning.	ICML	2009	DBLP DOI BibTeX RDF
1	Michael Drmota, Wojciech Szpankowski	(Un)expected behavior of digital search tree profile.	SODA	2009	DBLP DOI BibTeX RDF
1	Ravi Montenegro, Prasad Tetali	How long does it take to catch a wild kangaroo?	STOC	2009	DBLP DOI BibTeX RDF	pollard's kangaroo method, markov chain, digital signature, discrete logarithm, mixing time
1	David G. Kirkpatrick	Hyperbolic Dovetailing.	ESA	2009	DBLP DOI BibTeX RDF
1	Krzysztof Cetnarowicz	From Algorithm to Agent.	ICCS	2009	DBLP DOI BibTeX RDF
1	Om K. Gupta, Ray A. Jarvis	Using a Virtual World to Design a Simulation Platform for Vision and Robotic Systems.	ISVC	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	Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz	On Computational Models for Flash Memory Devices.	SEA	2009	DBLP DOI BibTeX RDF
1	Jirí Wiedermann, Lukás Petru	On the Universal Computing Power of Amorphous Computing Systems.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Simulation, Communication protocol, Universality, Probabilistic automata, Amorphous computing
1	Grzegorz Bancerek	Mizar Analysis of Algorithms: Algorithms over Integers.	Formalized Mathematics	2008	DBLP DOI BibTeX RDF
1	David B. Sher	A visual proof for an average case of list searching.	SIGCSE Bulletin	2008	DBLP DOI BibTeX RDF	data structures, computer science education, analysis of algorithms
1	Yong-Hsian Hsieh, Chih-Chiang Yu, Biing-Feng Wang	Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average.	IEEE/ACM Trans. Comput. Biology Bioinform.	2008	DBLP DOI BibTeX RDF	geometrical problems and computations, algorithms, data structures, analysis of algorithms
1	Eagu Kim, John D. Kececioglu	Learning Scoring Schemes for Sequence Alignment from Partial Examples.	IEEE/ACM Trans. Comput. Biology Bioinform.	2008	DBLP DOI BibTeX RDF	Linear programming, Pattern matching, Biology and genetics, Analysis of Algorithms and Problem Complexity
1	Rajeev Raman, David S. Wise	Converting to and from Dilated Integers.	IEEE Trans. Computers	2008	DBLP DOI BibTeX RDF	Data Structures: Arrays, Programming Techniques: General, Memory Structures: Design Styles, Analysis of Algorithms and Problem Complexity: Numerical algorithms, problems: computations on matrices
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	Alberto Apostolico, Cinzia Pizzi	Scoring Unusual Words with Varying Mismatch Errors.	Mathematics in Computer Science	2008	DBLP DOI BibTeX RDF	biosequences analysis, analysis of algorithms, pattern discovery, Combinatorics on words
1	Héctor Joaquin Fraire Huacuja, David Romero Vargas, Guadalupe Castilla Valdez, Carlos A. Camacho Andrade, Georgina Castillo Valdez, José A. Martínez Flores	Experimental Analysis for the Lennard-Jones Problem Solution.	Innovations in Hybrid Intelligent Systems	2008	DBLP DOI BibTeX RDF	Lennard-Jones potential, Genetic algorithms, Analysis of 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	Jun Liu, Xiangqian Liu, Xiaoli Ma	First-Order Perturbation Analysis of Singular Vectors in Singular Value Decomposition.	IEEE Transactions on Signal Processing	2008	DBLP DOI BibTeX RDF
1	Khaireel A. Mohamed, Tobias Langner, Thomas Ottmann	Versioning Tree Structures by Path-Merging.	FAW	2008	DBLP DOI BibTeX RDF	Partial persistence, path-merging, path-copying, node-copying
1	Robert J. Simmons, Frank Pfenning	Linear Logical Algorithms.	ICALP	2008	DBLP DOI BibTeX RDF	Bottom-up logic programming, forward reasoning, cost semantics, abstract running time, deductive databases, linear logic
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	Lauri Malmi, Ari Korhonen	Active Learning and Examination Methods in a Data Structures and Algorithms Course.	Reflections on the Teaching of Programming	2008	DBLP DOI BibTeX RDF
1	K. Subramani, Dejan Desovski	An empirical analysis of algorithms for partially Clairvoyant scheduling.	IJPEDS	2007	DBLP DOI BibTeX RDF
1	Celso C. Ribeiro, Rodrigo F. Toso	Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights.	WEA	2007	DBLP DOI BibTeX RDF	DRD-trees, algorithms, data structures, Minimum spanning trees, dynamic graph algorithms, experimental analysis
1	Steven Minsker	The linear twin Towers of Hanoi problem.	SIGCSE Bulletin	2007	DBLP DOI BibTeX RDF	recursion, analysis of algorithms, Towers of Hanoi
1	Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, Stéphane Vialette	Exemplar Longest Common Subsequence.	IEEE/ACM Trans. Comput. Biology Bioinform.	2007	DBLP DOI BibTeX RDF	combinatorial algorithms, comparative genomics, Longest common subsequence, algorithm design and analysis, analysis of algorithms and problem complexity
1	Guofei Jiang, Haifeng Chen, Kenji Yoshihira	Efficient and Scalable Algorithms for Inferring Likely Invariants in Distributed Systems.	IEEE Trans. Knowl. Data Eng.	2007	DBLP DOI BibTeX RDF	Data mining, Distributed Systems, Time series analysis, System Management, Analysis of Algorithms and Problem Complexity, Algorithms for data and knowledge management
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	Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir	New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks.	ESA	2007	DBLP DOI BibTeX RDF	networks, facility location, Analysis of algorithms
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	Marek Chrobak, Mathilde Hurand	Better Bounds for Incremental Medians.	WAOA	2007	DBLP DOI BibTeX RDF	Incremental medians, approximation algorithm, online algorithm, 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	Minghui Jiang, Joel Gillespie	Engineering the Divide-and-Conquer Closest Pair Algorithm.	J. Comput. Sci. Technol.	2007	DBLP DOI BibTeX RDF	circle packing, computational geometry, analysis of algorithms, algorithmic engineering, closest pair
1	Xiao-Dong Wang, Ying-Jie Wu	An Improved HEAPSORT Algorithm with n log n - 0.788928 n Comparisons in the Worst Case.	J. Comput. Sci. Technol.	2007	DBLP DOI BibTeX RDF	HEAPSORT, data structures, analysis of algorithms, heaps
1	Walter J. Gutjahr	Mathematical runtime analysis of ACO algorithms: survey on an emerging issue.	Swarm Intelligence	2007	DBLP DOI BibTeX RDF	Runtime complexity, Combinatorial optimization, Ant colony optimization, Analysis of algorithms, Runtime analysis
1	Matteo Frigo, Volker Strumpen	The memory behavior of cache oblivious stencil computations.	The Journal of Supercomputing	2007	DBLP DOI BibTeX RDF	Performance analysis, Analysis of algorithms, System simulation, Cache oblivious algorithms, Stencil computations
1	Emgad H. Bachoore, Hans L. Bodlaender	Weighted Treewidth Algorithmic Techniques and Results.	ISAAC	2007	DBLP DOI BibTeX RDF
1	Kang Sun, Jun Zheng, Yuanyuan Li, Xuezeng Pan	Design of a Simulator for Mesh-Based Reconfigurable Architectures.	NPC	2007	DBLP DOI BibTeX RDF	simulator, reconfigurable computing, dynamic reconfiguration, reconfigurable mesh
1	Abraham D. Flaxman, Alan M. Frieze, Juan Vera	A Geometric Preferential Attachment Model of Networks II.	WAW	2007	DBLP DOI BibTeX RDF