Search results for "amortized analysis"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	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
2	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
2	Yukikazu Nakamoto, Yoshihiro Tsujino, Nobuki Tokura	Real-time task scheduling algorithms for maximum utilization of secondary batteries in portable devices.	RTCSA	2000	DBLP DOI BibTeX RDF	secondary cells, power generation scheduling, power engineering computing, real time task scheduling algorithms, maximum utilization, secondary batteries, low power energy techniques, dynamic real time scheduling algorithms, secondary battery consumption, CPU frequency, real time scheduling algorithm, discrete frequency control, arbitrary frequency, real-time systems, computational complexity, computational complexity, NP-complete, portable devices, decision problem, portable computers, scheduling problem, task switching, real time tasks, amortized analysis, optimal scheduling algorithm, frequency control, frequency control
1	Jan Hoffmann 0002	An Automatic Amortized Analysis of the Resource Consumption of Functional Programs.	AlgoSyn	2010	DBLP BibTeX RDF
1	Jan Mehler, Friedhelm Meyer auf der Heide	Power-aware online file allocation in mobile ad hoc networks: [extended abstract].	SPAA	2009	DBLP DOI BibTeX RDF	mobile ad hoc networks, online algorithms, file allocation, amortized analysis
1	Haim Kaplan, Uri Zwick	A simpler implementation and analysis of Chazelle's soft heaps.	SODA	2009	DBLP DOI BibTeX RDF
1	Henning Fernau, Daniel Raible	Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs.	WALCOM	2008	DBLP DOI BibTeX RDF
1	Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang	A Constant-Competitive Algorithm for Online OVSF Code Assignment.	ISAAC	2007	DBLP DOI BibTeX RDF
1	Bohyung Han, Larry S. Davis	On-Line Density-Based Appearance Modeling for Object Tracking.	ICCV	2005	DBLP DOI BibTeX RDF
1	Mikhail Fomitchev, Eric Ruppert	Lock-free linked lists and skip lists.	PODC	2004	DBLP DOI BibTeX RDF	fault-tolerant, distributed, efficient, analysis, lock-free, linked list, skip list, amortized analysis
1	Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson	On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs.	SPAA	2004	DBLP DOI BibTeX RDF	SP-bags, SP-hybrid, SP-order, least common ancestor, order maintenance, series-parallel, algorithm, parallel computing, data structure, graph, tree, mutual exclusion, thread, trace, locking, multi-threading, data race, work stealing, race detection, Cilk, parse tree, amortized analysis, fork-join, on the fly, dynamic set
1	Moritz G. Maaß	Linear Bidirectional On-Line Construction of Affix Trees.	Algorithmica	2003	DBLP DOI BibTeX RDF	Affix tree, Pattern matching, Suffix tree, Algorithms and data structures, Amortized analysis
1	Jennie C. Hansen, Eric Schmutz	Near-Optimal Bounded-Degree Spanning Trees.	Algorithmica	2001	DBLP DOI BibTeX RDF	Relaxed balance, Data structures, Search trees, AVL trees, Amortized analysis
1	Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer	Relaxed Balance Using Standard Rotations.	Algorithmica	2001	DBLP DOI BibTeX RDF	Relaxed balance, Data structures, Search trees, AVL trees, Amortized analysis
1	Gregory C. Harfst, Edward M. Reingold	A potential-based amortized analysis of the union-find data structure.	SIGACT News	2000	DBLP DOI BibTeX RDF
1	Adriano Di Pasquale, Enrico Nardelli	Distributed Searching of k-Dimensional Data with Almost Constant Costs.	ADBIS-DASFAA	2000	DBLP DOI BibTeX RDF	message passing environment, multi-dimensional search, distributed data structure
1	Satoshi Fujita, Masafumi Yamashita	Maintaining a Dynamic Set of Processors in a Distributed System.	WDAG	1996	DBLP DOI BibTeX RDF	processor structure, amortized message complexity, data structure, group communication, dynamic set
1	Peter Auer, Manfred K. Warmuth	Tracking the Best Disjunction.	FOCS	1995	DBLP DOI BibTeX RDF	best disjunction tracking, deterministic on-line learning algorithm, k-literal disjunctions, worst-case mistake bounds, learning (artificial intelligence), upper bounds, computational linguistics, randomised algorithms, amortized analysis, Winnow
1	Tung-Shou Chen, Wei-Pang Yang	Amortized Analysis of Disk Scheduling Algorithm V(R).	J. Inf. Sci. Eng.	1992	DBLP BibTeX RDF
1	Tung-Shou Chen, Wei-Pang Yang, Richard C. T. Lee	Amortized Analysis of Some Disk Scheduling Algorithms: SSTF, SCAN, and N-Step SCAN.	BIT	1992	DBLP BibTeX RDF
1	Wen-Lian Hsu	A Simple Test for the Consecutive Ones Property.	ISAAC	1992	DBLP DOI BibTeX RDF
1	Jeffery Westbrook, Robert Endre Tarjan	Amortized Analysis of Algorithms for Set Union with Backtracking.	SIAM J. Comput.	1989	DBLP DOI BibTeX RDF
1	Kurt Mehlhorn, Athanasios K. Tsakalidis	An Amortized Analysis of Insertions into AVL-Trees.	SIAM J. Comput.	1986	DBLP DOI BibTeX RDF