Search results for "running-time"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
73	Gertrud S. Joachim	Memory Efficiency.	J. ACM	1959	DBLP DOI BibTeX RDF
41	Bruce Randall Donald, Davied Renpan Chang	On the Complexity of Computing the Homology Type of a Triangulation	FOCS	1991	DBLP DOI BibTeX RDF	homology triangulation, quadratic expected running time, linear expected running time, finite simplicial complex, integer coefficients, Bezier-spline surfaces, topological type, sparseness measure, computer-aided design, probabilistic analysis, simplices, homology groups, worst-case bounds, finite-element meshes, geometric complexity
41	Edin Hodzic, Weijia Shang	On Supernode Transformation with Minimized Total Running Time.	ASAP	1996	DBLP DOI BibTeX RDF	supernode transformation, minimizing running time, reducing communication startup cost, message passing, Parallelizing compilers, distributed memory parallel computers
38	Omer Berkman, Yossi Matias	Fast parallel algorithms for minimum and related problems with small integer inputs.	IPPS	1995	DBLP DOI BibTeX RDF	integer inputs, prefix minima, range minima, integer domain, domain size, parallel algorithms, parallel algorithms, computational complexity, complexities, running time
37	Marco Laumanns, Lothar Thiele, Eckart Zitzler	Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem.	Nat. Comput.	2004	DBLP DOI BibTeX RDF	decision space partition, evolutionary algorithms, multiobjective optimization, knapsack problem, graph search, running time analysis, Pareto set
34	Edin Hodzic, Weijia Shang	On Supernode Transformation with Minimized Total Running Time.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	Supernode partitioning, minimizing running time, parallelizing compilers, tiling, distributed memory multicomputer
32	Tony Savor, Rudolph E. Seviora	Improving the efficiency of supervision by software through state aggregation.	IEEE Real Time Technology and Applications Symposium	1995	DBLP DOI BibTeX RDF	private telephone exchanges, supervisory software, software supervision, real time failure detection, real time system monitoring, running time complexity, specification processes, software supervisor, ITU Specification and Description Language, small private branch telephone exchange, SDL processes, telecom switching software, real-time systems, computational complexity, formal specification, fault diagnosis, telecommunication computing, state transitions, telecommunication control, computerised monitoring, inputs queues, state aggregation
31	Yuanyuan Zhang, Wei Sun 0004, Yasushi Inoguchi	Predicting Running Time of Grid Tasks based on CPU Load Predictions.	GRID	2006	DBLP DOI BibTeX RDF
28	Yu-Kwong Kwok, Ishfaq Ahmad	A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors.	IEEE PACT	1997	DBLP DOI BibTeX RDF	parallel randomized algorithm, PFAST algorithm, parallel fast assignment, parallel random search technique, computer-aided parallelization, computer-aided scheduling tool, CASCH tool, running time constraints, parallel programming, parallel programs, multiprocessors, time complexity, directed acyclic graphs, execution times, linear-time algorithm, Intel Paragon, compile-time scheduling
28	Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis	A Parallel Priority Data Structure with Applications.	IPPS	1997	DBLP DOI BibTeX RDF	parallel priority data structure, algorithm running time, data structures, time complexity, iteration, parallel implementation, Dijkstra's algorithm, CREW PRAM
28	Lee E. Heindel, Vincent A. Kasten	Real-time UNIX application filestores.	IEEE Real Time Technology and Applications Symposium	1995	DBLP DOI BibTeX RDF	real-time UNIX application filestores, disk I/O performance, physical file I/Os, analytical approximations, application process elapsed running time, real-time systems, Unix, file organisation, input-output programs, UNIX operating system
28	Dmitry G. Korzun, Andrei V. Gurtov	A local equilibrium model for P2P resource ranking.	SIGMETRICS Perform. Evaluation Rev.	2009	DBLP DOI BibTeX RDF
28	Bill Lin 0001, Jun (Jim) Xu, Nan Hua, Hao Wang 0006, Haiquan (Chuck) Zhao	A randomized interleaved DRAM architecture for the maintenance of exact statistics counters.	SIGMETRICS Perform. Evaluation Rev.	2009	DBLP DOI BibTeX RDF
28	Sipat Triukose, Zhihua Wen, Michael Rabinovich	Content delivery networks: how big is big enough?	SIGMETRICS Perform. Evaluation Rev.	2009	DBLP DOI BibTeX RDF
28	Alma Riska, Erik Riedel	Evaluation of disk-level workloads at different time scales.	SIGMETRICS Perform. Evaluation Rev.	2009	DBLP DOI BibTeX RDF
25	Ali Ahmadinia, Christophe Bobda, Sándor P. Fekete, Jürgen Teich, Jan van der Veen	Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices.	FPL	2004	DBLP DOI BibTeX RDF	field-programable gate array (FPGA), occupied space manager (OSM), routing-conscious placement, Manhattan metric, line sweep technique, optimal running time, lower bounds, Reconfigurable computing, module placement
25	Edin Hodzic, Weijia Shang	On Time Optimal Supernode Shape.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	Supernode transformation, algorithm partitioning, minimizing running time, parallelizing compilers, tiling, distributed memory multicomputer
24	Siguna Müller	A Probable Prime Test with Very High Confidence for n L 3 mod 4.	J. Cryptol.	2003	DBLP DOI BibTeX RDF	Probable prime testing, Combined test, Quadratic fields, Efficiency, Running time, Failure probability
24	Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber, Raúl P. Rentería	Fast Calculation of Optimal Strategies for Searching with Non-Uniform Costs.	SPIRE	2000	DBLP DOI BibTeX RDF	optimal search strategies, nonuniform access costs, worst-case cost minimization, last accessed key, magnetic disks, optical disks, expected running time, cost matrix, tree searching, NUMA, binary search tree
24	Ines Peters, Paul Molitor	Priority driven channel pin assignment.	Great Lakes Symposium on VLSI	1995	DBLP DOI BibTeX RDF	polynomial time improvement, linear channel pin assignment, LCPA algorithms, minimum channel density, vertical constraints, priority driven channel pin assignment, channel height, computational complexity, VLSI, VLSI, network routing, circuit layout CAD, running time, integrated circuit layout, priority schedule, channel routing
24	Seong-Won Lee, Soo-Mook Moon, Seong-Moo Kim	Enhanced hot spot detection heuristics for embedded java just-in-time compilers.	LCTES	2008	DBLP DOI BibTeX RDF	hot spot detection, j2me cdc, java just-in-time compilation, sun's hotspot heuristic, java virtual machine
24	Robert J. Simmons, Frank Pfenning	Linear Logical Algorithms.	ICALP (2)	2008	DBLP DOI BibTeX RDF	Bottom-up logic programming, forward reasoning, cost semantics, abstract running time, deductive databases, linear logic
24	Zhaohui Li, Liang Zhao 0001, Nei Yoshihiro Soma	Fractal Color Image Compression.	SIBGRAPI	2000	DBLP DOI BibTeX RDF	fractal color image compression, Fractal Hierarchical Color Block Coding, FHCBC, three-color planes, one-component image, homogeneous blocks, pixel trichromatic coefficients, mean value, decoding process, fractal decoding algorithm, mean values, trichromatic coefficient ratios, three-component Separated Fractal Coding, data compression, running time, compression ratio, performance gains, fractal coding, threshold value, reconstruction quality
24	Rumen Andonov, Nicola Yanev, Hafid Bourzoufi	Three-dimensional orthogonal tile sizing problem: mathematical programming approach.	ASAP	1997	DBLP DOI BibTeX RDF	three-dimensional orthogonal tile sizing problem, mathematical programming approach, optimal tiling transformation, three-dimensional uniform recurrences, distributed-memory general-purpose machines, parallelizing compilers, running time, performance tuning, parallelising compilers, nonlinear integer programming, parallel codes
24	Cláudio T. Silva, Joseph S. B. Mitchell, Arie E. Kaufman	Automatic Generation of Triangular Irregular Networks Using Greedy Cuts.	IEEE Visualization	1995	DBLP DOI BibTeX RDF	triangular irregular networks, dense terrain models, greedy cuts, minimum-link paths, closed polygon, ear cutting, greedy biting, edge splitting, structural terrain fidelity, input height array, graph theory, triangulation, data visualisation, mesh generation, running time, automatic generation, memory requirements
24	James M. Varanelli, James P. Cohoon	A two-stage simulated annealing methodology.	Great Lakes Symposium on VLSI	1995	DBLP DOI BibTeX RDF	two-stage simulated annealing methodology, starting temperature determination, problem suite, VLSI, VLSI, formal method, simulated annealing, CAD, integrated circuit design, circuit CAD, optimization problems, circuit optimisation, running time, adaptive schedules, stop criterion
24	Michael J. Fischer, Mike Paterson	Fishspear: A Priority Queue Algorithm.	J. ACM	1994	DBLP DOI BibTeX RDF	comparison count, sequential storage, online algorithm, priority queue, running time, complexity analysis, heap
24	Peter A. Dinda	Online Prediction of the Running Time of Tasks.	HPDC	2001	DBLP DOI BibTeX RDF
23	Menno Dobber, Robert D. van der Mei, Ger Koole	Statistical Properties of Task Running Times in a Global-Scale Grid Environment.	CCGRID	2006	DBLP DOI BibTeX RDF
23	Turan Erden, Mehmet Zeki Coskun	Analyzing Shortest and Fastest Paths with GIS and Determining Algorithm Running Time.	VISUAL	2005	DBLP DOI BibTeX RDF
23	David W. Juedes, Frank Drews, Dazhang Gu, Lonnie R. Welch, Klaus H. Ecker, Silke Schomann	Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions.	Real Time Syst.	2006	DBLP DOI BibTeX RDF	Optimization, Resource allocation, Parallel systems, Real-time computing, Dynamic real-time systems
21	Christine Rüb	On the Average Running Time of Odd-Even Merge Sort.	STACS	1995	DBLP DOI BibTeX RDF
21	Bodo Manthey, Heiko Röglin	Improved smoothed analysis of the k-means method.	SODA	2009	DBLP DOI BibTeX RDF
21	Yen-Chun Lin, Chun-Yu Ko	New Parallel Prefix Algorithm for Multicomputers.	ISPA	2011	DBLP DOI BibTeX RDF	half-duplex communication, minimal running time, parallel prefix algorithm, message-passing multicomputer
21	Christian Horoba, Dirk Sudholt	Ant colony optimization for stochastic shortest path problems.	GECCO	2010	DBLP DOI BibTeX RDF	combinatorial optimization, ant colony optimization, stochastic optimization, shortest path problems, running time analysis
21	Benjamin Doerr, Daniel Johannsen, Carola Winzen	Multiplicative drift analysis.	GECCO	2010	DBLP DOI BibTeX RDF	theory, running time analysis
21	Daniel Johannsen, Piyush P. Kurur, Johannes Lengler	Can quantum search accelerate evolutionary algorithms?	GECCO	2010	DBLP DOI BibTeX RDF	theory, quantum algorithm, running time analysis
21	Frank Neumann 0001, Pietro S. Oliveto, Carsten Witt	Theoretical analysis of fitness-proportional selection: landscapes and efficiency.	GECCO	2009	DBLP DOI BibTeX RDF	genetic algorithms, theory, selection, running time analysis
21	Jon Lee 0001, Shmuel Onn, Robert Weismantel	Nonlinear Optimization over a Weighted Independence System.	AAIM	2009	DBLP DOI BibTeX RDF	independence system, oracle computation, exponential running time, Frobenius number, approximation algorithm, combinatorial optimization, integer programming, nonlinear optimization, matroid
21	Edda Happ, Daniel Johannsen, Christian Klein 0001, Frank Neumann 0001	Rigorous analyses of fitness-proportional selection for optimizing linear functions.	GECCO	2008	DBLP DOI BibTeX RDF	theory, selection, running time analysis
21	Christian Horoba, Frank Neumann 0001	Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization.	GECCO	2008	DBLP DOI BibTeX RDF	multi-objective optimization, running time analysis
21	Steffen Christensen, Franz Oppacher	Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations.	GECCO	2007	DBLP DOI BibTeX RDF	genetic programming, representations, running time analysis, speedup technique
21	Dimo Brockhoff, Tobias Friedrich 0001, Nils Hebbinghaus, Christian Klein 0001, Frank Neumann 0001, Eckart Zitzler	Do additional objectives make a problem harder?	GECCO	2007	DBLP DOI BibTeX RDF	multi-objective optimization, running time analysis
21	Frank Neumann 0001, Ingo Wegener	Minimum spanning trees made easier via multi-objective optimization.	Nat. Comput.	2006	DBLP DOI BibTeX RDF	multi-objective optimization, running time analysis, working principles of evolutionary computing
21	Dirk Sudholt	On the analysis of the (1+1) memetic algorithm.	GECCO	2006	DBLP DOI BibTeX RDF	local search, theory, hybridization, running time analysis
21	Frank Neumann 0001, Ingo Wegener	Minimum spanning trees made easier via multi-objective optimization.	GECCO	2005	DBLP DOI BibTeX RDF	multi-objective optimization, running time analysis, working principles of evolutionary computing
21	Oded Goldreich 0001, Ronitt Rubinfeld, Madhu Sudan 0001	Learning Polynomials with Queries: The Highly Noisy Case.	FOCS	1995	DBLP DOI BibTeX RDF	polynomials with queries learning, highly noisy case, n-variate inputs, n-variate degree d polynomials, learning (artificial intelligence), randomized algorithm, finite field, polynomials, explanation, running time, randomised algorithms
21	David J. Aldous, Umesh V. Vazirani	"Go With the Winners" Algorithms	FOCS	1994	DBLP DOI BibTeX RDF	worst case running time, Go with the winners, randomized optimization algorithms, rigorous analysis, deep leaf, probability of success, searching, tree, worst-case
21	Monika Rauch	Fully Dynamic Biconnectivity in Graphs	FOCS	1992	DBLP DOI BibTeX RDF	query time, dynamic biconnectivity, edge insertions, linear storage, amortized running time, planar embedded graph, graphs, time complexity, deletions
21	Joseph S. B. Mitchell, Christine D. Piatko, Esther M. Arkin	Computing a Shortest k-Link Path in a Polygon	FOCS	1992	DBLP DOI BibTeX RDF	exact polynomial-time algorithm, shortest k-link path, bicriteria path problem, computational geometry, polygon, running time, visibility graph, holes
21	Ilan Adler, Peter A. Beling	Polynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant Matrices	FOCS	1991	DBLP DOI BibTeX RDF	algebraic integers, subring, encoding size, bit size, Tardos scheme, strongly polynomial time, linear programming, interior point method, square roots, running time, polynomial algorithms, real numbers, circulant matrices
21	Joseph Gil, Yossi Matias, Uzi Vishkin	Towards a Theory of Nearly Constant Time Parallel Algorithms	FOCS	1991	DBLP DOI BibTeX RDF	superfast optimal algorithms, nearly constant time parallel algorithms, positive numbers, estimation, randomization, running time
21	Hillel Gazit	A Deterministic Parallel Algorithm for Planar Graphs Isomorphism	FOCS	1991	DBLP DOI BibTeX RDF	processors count, deterministic parallel algorithm, planar graphs isomorphism, separators, running time
21	Ketan Mulmuley	Randomized Multidimensional Search Trees: Further Results in Dynamic Sampling (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	half space range queries, randomized multidimensional search trees, dynamic sampling, dynamic search structures, 3-D partitions, possibly interesting polygons, dynamic nearest-k-neighbor queries, algorithm, running time, random sequence
21	Serge A. Plotkin, David B. Shmoys, Éva Tardos	Fast Approximation Algorithms for Fractional Packing and Covering Problems	FOCS	1991	DBLP DOI BibTeX RDF	fractional covering, fractional packing, approximation algorithms, linear programming, Lagrangian relaxation, running time, multicommodity flow problems
21	Amitava Majumdar 0002, Cauligi S. Raghavendra, Melvin A. Breuer	Fault Tolerance in Linear Systolic Arrays Using Time Redundancy.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	triple time redundancy, gracefully degradable mode, fault tolerant computing, logic testing, reconfiguration, throughput, interconnection, switching, performance metrics, cellular arrays, running time, reliability analysis, control structures, fault-tolerant capabilities, linear systolic arrays
21	Pravin M. Vaidya	Reducing the Parallel Complexity of Certain Linear Programming Problems (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	moderate density, parallel running time, uncapacitated transportation problem, edge cost, parallel algorithm, linear programming, graphs, interior point methods, assignment problem, parallel complexity
21	László Lovász 0001, Miklós Simonovits	The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume	FOCS	1990	DBLP DOI BibTeX RDF	mixing rate, Markov chains, running-time, conductance, convex body, convex body, isoperimetric inequality, time-reversible
20	Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin	A k-Median Algorithm with Running Time Independent of Data Size.	Mach. Learn.	2004	DBLP DOI BibTeX RDF	sublinear, clustering, sampling
20	Nilanjan Banerjee, Rajeev Kumar 0004	Expected Running Time Analysis of a Multiobjective Evolutionary Algorithm on Pseudo-boolean Functions.	ICONIP	2004	DBLP DOI BibTeX RDF
20	Leonid Barenboim, Michael Elkin	Distributed (delta+1)-coloring in linear (in delta) time.	STOC	2009	DBLP DOI BibTeX RDF	defective-coloring, distributed algorithms, coloring
20	René Beier, Berthold Vöcking	Probabilistic analysis of knapsack core algorithms.	SODA	2004	DBLP BibTeX RDF
20	Christian Horoba, Dirk Sudholt	Running Time Analysis of ACO Systems for Shortest Path Problems.	SLS	2009	DBLP DOI BibTeX RDF
20	Jingbo Yuan, Jiubin Ju, Liang Hu, Shunli Ding	Prediction of the Running Time of Tasks Based on Load.	ICEBE	2005	DBLP DOI BibTeX RDF
20	Omar Bakr, Idit Keidar	Evaluating the running time of a communication round over the internet.	PODC	2002	DBLP DOI BibTeX RDF
19	Janis Kaneps, Rusins Freivalds	Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata.	ICALP	1991	DBLP DOI BibTeX RDF
17	Marco Laumanns, Lothar Thiele, Eckart Zitzler, Emo Welzl, Kalyanmoy Deb	Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem.	PPSN	2002	DBLP DOI BibTeX RDF
17	Yuren Zhou, Zhi Guo, Jun He 0004	On the Running Time Analysis of the (1+1) Evolutionary Algorithm for the Subset Sum Problem.	LSMS (1)	2007	DBLP DOI BibTeX RDF
17	Sergey S. Fedin, Alexander S. Kulikov	Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms.	IWPEC	2004	DBLP DOI BibTeX RDF
17	Xin Gao 0001, Shuaicheng Li 0001, Yinan Lu	New Algorithms for the Spaced Seeds.	FAW	2007	DBLP DOI BibTeX RDF	bioinformatics, homology search, spaced seed
17	Rajeev Kumar 0004, Nilanjan Banerjee	Running Time Analysis of a Multiobjective Evolutionary Algorithm on Simple and Hard Problems.	FOGA	2005	DBLP DOI BibTeX RDF
17	Franck Guingne, André Kempe, Florent Nicart	Running Time Complexity of Printing an Acyclic Automaton.	CIAA	2003	DBLP DOI BibTeX RDF
17	Zvi Galil	On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm.	ICALP	1978	DBLP DOI BibTeX RDF
17	Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi	Breaking the O(m2n) Barrier for Minimum Cycle Bases.	ESA	2009	DBLP DOI BibTeX RDF
15	Xiaorou Zheng, Jianxin Jia, Shanxin Guo, Jinsong Chen, Luyi Sun, Yingfei Xiong 0002, Wenna Xu	Full Parameter Time Complexity (FPTC): A Method to Evaluate the Running Time of Machine Learning Classifiers for Land Use/Land Cover Classification.	IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens.	2021	DBLP DOI BibTeX RDF
15	Teresa Cristóbal, Gabino Padrón, Alexis Quesada-Arencibia, Francisco Alayón Hernández, Gabriel de Blasio, Carmelo R. García	Using Data Mining to Analyze Dwell Time and Nonstop Running Time in Road-Based Mass Transit Systems.	UCAmI	2018	DBLP DOI BibTeX RDF
15	An Commeine, Igor A. Semaev	An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve.	Public Key Cryptography	2006	DBLP DOI BibTeX RDF	Discrete Logarithms, Number Field Sieve
15	Fedor V. Fomin, Fabrizio Grandoni 0001, Dieter Kratsch	A measure & conquer approach for the analysis of exact algorithms.	J. ACM	2009	DBLP DOI BibTeX RDF	Dominating set, exact algorithm, independent set
15	Sanjeev Arora	Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems.	J. ACM	1998	DBLP DOI BibTeX RDF	approximation algorithms, matching, traveling salesman problem, network design, Steiner problem
14	Yang Liu 0002, Songjian Lu, Jianer Chen, Sing-Hoi Sze	Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms.	IWPEC	2006	DBLP DOI BibTeX RDF
14	Shiva Chaudhuri, Torben Hagerup, Rajeev Raman	Approximate and Exact Deterministic Parallel Selection.	MFCS	1993	DBLP DOI BibTeX RDF
14	Zinaida Benenson	Lower Bounds.	Algorithms for Sensor and Ad Hoc Networks	2007	DBLP DOI BibTeX RDF
14	Hettihe P. Dharmasena, Ramachandran Vaidyanathan	Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF	Multiple bus networks, binary tree algorithms, bus loading, interconnection networks, lower bounds
14	Michael Elkin	A faster distributed protocol for constructing a minimum spanning tree.	SODA	2004	DBLP BibTeX RDF
14	Fabian Wolf, Jan Staschulat, Rolf Ernst	Associative caches in formal software timing analysis.	DAC	2002	DBLP DOI BibTeX RDF	real-time, timing analysis, embedded software, cache analysis
14	Siguna Müller	A Probable Prime Test with Very High Confidence for n equiv 1 mod 4.	ASIACRYPT	2001	DBLP DOI BibTeX RDF
14	Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars	An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version).	ICALP	1990	DBLP DOI BibTeX RDF
14	Oriana Ponta, Falk Hüffner, Rolf Niedermeier	Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems.	TAMC	2008	DBLP DOI BibTeX RDF
14	Liam Roditty, Asaf Shapira	All-Pairs Shortest Paths with a Sublinear Additive Error.	ICALP (1)	2008	DBLP DOI BibTeX RDF
14	Matthias Englert, Heiko Röglin, Berthold Vöcking	Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract.	SODA	2007	DBLP BibTeX RDF
14	Bahador Bakhshi, Babak Sadeghiyan	A Timing Attack on Blakley's Modular Multiplication Algorithm, and Applications to DSA.	ACNS	2007	DBLP DOI BibTeX RDF	Blakley’s algorithm, modular multiplication, timing attack, DSA
14	Yonatan Bilu, Pankaj K. Agarwal, Rachel Kolodny	Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons.	IEEE ACM Trans. Comput. Biol. Bioinform.	2006	DBLP DOI BibTeX RDF	algorithms, dynamic programming, shortest path, Multiple Sequence Alignment
14	Victor Milenkovic, Elisha Sacks	An approximate arrangement algorithm for semi-algebraic curves.	SCG	2006	DBLP DOI BibTeX RDF	robust computational geometry, arrangements
14	Jianer Chen, Iyad A. Kanj, Ge Xia	Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.	Algorithmica	2005	DBLP DOI BibTeX RDF	Exact algorithm, Independent set, Vertex cover, Parameterized algorithm
14	Jianer Chen, Iyad A. Kanj, Ge Xia	Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.	ISAAC	2003	DBLP DOI BibTeX RDF
14	Michael Alekhnovich, Eli Ben-Sasson	Linear Upper Bounds for Random Walk on Small Density Random 3-CNF.	FOCS	2003	DBLP DOI BibTeX RDF
14	Fabian Wolf, Rolf Ernst, Wei Ye 0002	Path clustering in software timing analysis.	IEEE Trans. Very Large Scale Integr. Syst.	2001	DBLP DOI BibTeX RDF
14	Tamar Domani, Elliot K. Kolodner, Erez Petrank	A generational on-the-fly garbage collector for Java.	PLDI	2000	DBLP DOI BibTeX RDF	programming languages, garbage collection, memory management, generational garbage collection
14	Oded Goldreich 0001, Rafail Ostrovsky	Software Protection and Simulation on Oblivious RAMs.	J. ACM	1996	DBLP DOI BibTeX RDF	simulation of random access machines, software protection, pseudorandom functions
14	Lincong Wang, Ramgopal R. Mettu, Bruce Randall Donald	An Algebraic Geometry Approach to Protein Structure Determination from NMR Data.	CSB	2005	DBLP DOI BibTeX RDF