|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 167 occurrences of 111 keywords
|
|
|
|
|
Results
Found 234 publication records. Showing 234 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 3 | Mark Scharbrodt, Thomas Schickinger, Angelika Steger |
A new average case analysis for completion time scheduling.  |
J. ACM  |
2006 |
DBLP DOI BibTeX RDF |
average case analysis, Scheduling theory |
| 3 | Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri |
Average-Case Analysis for a Simple Compression Algorithm.  |
Algorithmica  |
1998 |
DBLP DOI BibTeX RDF |
Static dictionary problem, Table compression, Average case analysis |
| 2 | Jérémie Bourdon, Irena Rusu |
Statistical Properties of Factor Oracles.  |
CPM  |
2009 |
DBLP DOI BibTeX RDF |
factor recognition, suffix recognition, average-case analysis, indexing structure |
| 2 | Nir Naaman, Raphael Rom |
Average Case Analysis of Bounded Space Bin Packing Algorithms.  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
Discrete item size distribution, Bounded space, Algorithms, Bin packing, Average case analysis |
| 2 | Tobias Friedrich, Nils Hebbinghaus |
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.  |
ISAAC  |
2008 |
DBLP DOI BibTeX RDF |
shortest paths, random graphs, average-case analysis, Dynamic graph algorithms |
| 2 | Karl Heinz Borgwardt |
Average-Case Analysis of the Double Description Method and the Beneath-Beyond Algorithm.  |
Discrete & Computational Geometry  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Deepak Ajwani, Tobias Friedrich |
Average-Case Analysis of Online Topological Ordering.  |
ISAAC  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Nicholas H. Zamora, Xiaoping Hu, Radu Marculescu |
System-level performance/power analysis for platform-based design of multimedia applications.  |
ACM Trans. Design Autom. Electr. Syst.  |
2007 |
DBLP DOI BibTeX RDF |
stochastic automata networks (SANs), Markov chains, performance models, design space exploration, hardware/software codesign, average-case analysis, platform-based design |
| 2 | Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky |
Abstract Interpretation for Worst and Average Case Analysis.  |
Program Analysis and Compilation  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Olgica Milenkovic, Kevin J. Compton |
Average Case Analysis of Gosper's Algorithm for a Class of Urn Model Inputs.  |
Algorithmica  |
2005 |
DBLP DOI BibTeX RDF |
Gosper’s algorithm, Urn models, Hypergeometric functions |
| 2 | Irith Pomeranz, Sudhakar M. Reddy |
Worst-Case and Average-Case Analysis of n-Detection Test Sets.  |
DATE  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Richard Cole, David C. Kandathil |
The Average Case Analysis of Partition Sorts.  |
ESA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | René Beier, Berthold Vöcking |
Typical properties of winners and losers in discrete optimization.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
optimization problems, average-case analysis, smoothed analysis |
| 2 | René Beier, Berthold Vöcking |
Random knapsack in expected polynomial time.  |
STOC  |
2003 |
DBLP DOI BibTeX RDF |
knapsack problem, exact algorithms, average case analysis |
| 2 | Binhai Zhu |
On Lawson's Oriented Walk in Random Delaunay Triangulations.  |
FCT  |
2003 |
DBLP DOI BibTeX RDF |
Random Delaunay triangulation, average-case analysis, point location |
| 2 | Mark Scharbrodt, Thomas Schickinger, Angelika Steger |
A new average case analysis for completion time scheduling.  |
STOC  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis |
Smart dust protocols for local detection and propagation.  |
POMC  |
2002 |
DBLP DOI BibTeX RDF |
local detection, smart dust, sensor networks, propagation, average case analysis |
| 2 | Fabrício Alves Barbosa da Silva, Isaac D. Scherson |
Simulation-Based Average Case Analysis for Parallel Job Scheduling.  |
Annual Simulation Symposium  |
2001 |
DBLP DOI BibTeX RDF |
Dynamic Algorithm Analysis, Parallel Computation, Resource Management, Competitive Analysis, Bin-Packing, Gang scheduling, Parallel Job Scheduling, Coscheduling |
| 2 | Thomas Zeugmann |
Stochastic Finite Learning.  |
SAGA  |
2001 |
DBLP DOI BibTeX RDF |
stochastic finite learning, conjunctive concepts, pattern languages, average-case analysis, Inductive inference |
| 2 | Tobias Scheffer |
Average-Case Analysis of Classification Algorithms for Boolean Functions and Decision Trees.  |
ALT  |
2000 |
DBLP DOI BibTeX RDF |
|
| 2 | Rüdiger Reischuk, Thomas Zeugmann |
A Complete and Tight Average-Case Analysis of Learning Monomials.  |
STACS  |
1999 |
DBLP DOI BibTeX RDF |
|
| 2 | Rainer Kemp |
Generating Words Lexicographically: An Average-Case Analysis.  |
Acta Inf.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 2 | Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha |
Average-Case Analysis of the Merging Algorithm of Hwang and Lin.  |
Algorithmica  |
1998 |
DBLP DOI BibTeX RDF |
Merging, Average-case analysis |
| 2 | Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer |
Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs.  |
WG  |
1993 |
DBLP DOI BibTeX RDF |
|
| 2 | Christian Lavault |
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal).  |
CONPAR  |
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 |
| 2 | Brigitte Vallée, Philippe Flajolet |
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis  |
FOCS  |
1990 |
DBLP DOI BibTeX RDF |
linear fractional transformations, lattice reduction algorithm, Gauss, average case analysis, continued fractions, average-case complexity |
| 1 | Frédérique Bassino, Julien David, Cyril Nicaud |
Average Case Analysis of Moore's State Minimization Algorithm.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | James Allen Fill, Svante Janson |
The number of bit comparisons used by Quicksort: an average-case analysis  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Manas Joglekar, Nisarg Shah |
Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Mathilde Bouvel, Cedric Chauve, Marni Mishna, Dominique Rossin |
Average-case analysis of perfect sorting by reversals (Journal Version)  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Yevgeniy Vorobeychik, Yagil Engel |
Average-case analysis of VCG with approximate resource allocation algorithms.  |
Decision Support Systems  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ang Gao, Kenneth Rea, Michel P. Schellekens |
Static Average Case Analysis Fork-Join Framework Programs Based on MOQA Method.  |
PARELEC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel P. Schellekens |
MO2A; unlocking the potential of compositional static average-case analysis.  |
J. Log. Algebr. Program.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Donatella Merlini, Renzo Sprugnoli |
The relevant prefixes of coloured Motzkin walks: An average case analysis.  |
Theor. Comput. Sci.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Osamu Watanabe, Masaki Yamamoto |
Average-case analysis for the MAX-2SAT problem.  |
Theor. Comput. Sci.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Kutzelnigg |
An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations.  |
Mathematics in Computer Science  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Deepak Ajwani, Tobias Friedrich |
Average-case analysis of incremental topological ordering.  |
Discrete Applied Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonina C. Eldar, Holger Rauhut |
Average case analysis of multichannel sparse recovery using convex relaxation.  |
IEEE Transactions on Information Theory  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yevgeniy Vorobeychik, Yagil Engel |
Average-Case Analysis of Mechanism Design with Approximate Resource Allocation Algorithms.  |
WINE  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Petros Boufounos, Gitta Kutyniok, Holger Rauhut |
Average case analysis of sparse recovery from combined fusion frame measurements.  |
CISS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Alonso, Edward M. Reingold |
Average-case analysis of some plurality algorithms.  |
ACM Transactions on Algorithms  |
2009 |
DBLP DOI BibTeX RDF |
majority problem, plurality problem, Algorithm analysis |
| 1 | Mathilde Bouvel, Cedric Chauve, Marni Mishna, Dominique Rossin |
Average-case analysis of perfect sorting by reversals  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yonina C. Eldar, Holger Rauhut |
Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andreas Karrenbauer, Thomas Rothvoß |
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling.  |
ESA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathilde Bouvel, Cedric Chauve, Marni Mishna, Dominique Rossin |
Average-Case Analysis of Perfect Sorting by Reversals.  |
CPM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Axel Simroth, Alexander Souza |
On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis.  |
COCOON  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | George S. Lueker |
Improved bounds on the average length of longest common subsequences.  |
J. ACM  |
2009 |
DBLP DOI BibTeX RDF |
Arratia-Steele conjecture, dynamic programming, average-case analysis, Longest common subsequences |
| 1 | Tobias Lauer, Dominic Mai, Philippe Hagedorn |
Efficient Range-Sum Queries along Dimensional Hierarchies in Data Cubes.  |
DBKDA  |
2009 |
DBLP DOI BibTeX RDF |
range-sum query, pre-aggregation, OLAP, updates, data cube, average-case analysis |
| 1 | Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin |
Average-Case Analyses of Vickrey Costs.  |
APPROX-RANDOM  |
2009 |
DBLP DOI BibTeX RDF |
VCG auction, Random Assignment Problem, shortest path, minimum spanning tree, random graph, Average-case analysis, MST |
| 1 | Mikael Onsjö, Osamu Watanabe |
Theory of Computing Systems (TOCS) Submission Version Finding Most Likely Solutions.  |
Theory Comput. Syst.  |
2009 |
DBLP DOI BibTeX RDF |
Most-likely solution, Planted solution model, Average-case analysis, Message passing algorithm |
| 1 | Siddhartha Sen, Robert Endre Tarjan |
Deletion without Rebalancing in Multiway Search Trees.  |
ISAAC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Deepak Ajwani, Tobias Friedrich |
Average-Case Analysis of Online Topological Ordering  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Mohammad Golbabaee, Pierre Vandergheynst |
Average case analysis of sparse recovery with thresholding : New bounds based on average dictionary coherence.  |
ICASSP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Kutzelnigg |
An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations.  |
IWOCA  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Esther Mohr, Günter Schmidt |
Empirical Analysis of an Online Algorithm for Multiple Trading Problems.  |
MCO  |
2008 |
DBLP DOI BibTeX RDF |
trading rules, trading problem, performance analysis, online algorithms, competitive analysis, average case analysis, empirical analysis, stock trading |
| 1 | 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 |
| 1 | Christopher J. Osborn, Eric Torng |
List's worst-average-case or WAC ratio.  |
J. Scheduling  |
2008 |
DBLP DOI BibTeX RDF |
Competitive analysis, Makespan, Average-case analysis, List scheduling, Online scheduling |
| 1 | Bernard Chazelle, Wolfgang Johann Heinrich Mulzer |
Markov incremental constructions.  |
Symposium on Computational Geometry  |
2008 |
DBLP DOI BibTeX RDF |
clarkson-shor bound, randomized incremental constructions, expander graphs |
| 1 | Nadathur Satish, Kaushik Ravindran, Kurt Keutzer |
Scheduling task dependence graphs with variable task execution times onto heterogeneous multiprocessors.  |
EMSOFT  |
2008 |
DBLP DOI BibTeX RDF |
statistical scheduling, scheduling, simulated annealing, variability, list-scheduling |
| 1 | Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski |
Stochastic analyses for online combinatorial optimization problems.  |
SODA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Shetty, Assane Gueye, Jean C. Walrand |
A novel approach to bottleneck analysis in networks.  |
NOMS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan Lucier, Tao Jiang, Ming Li |
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility.  |
Inf. Process. Lett.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang |
Average case analysis for tree labelling schemes.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eitan Bachmat |
Average Case Analysis of Disk Scheduling, Increasing Subsequences and Spacetime Geometry.  |
Algorithmica  |
2007 |
DBLP DOI BibTeX RDF |
Increasing subsequences, Spacetime geometry, Patience sorting, Disk scheduling |
| 1 | Irith Pomeranz, Sudhakar M. Reddy |
Worst-Case and Average-Case Analysis of n-Detection Test Sets  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Irith Pomeranz, Sudhakar M. Reddy |
Worst-case and average-case analysis of n-detection test sets and test generation strategies.  |
IET Computers & Digital Techniques  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Singer, David J. Haglin, Anna M. Manning |
Towards Average Case Analysis of Itemset Mining.  |
DMIN  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Chunlin Xin, Weimin Ma, Fanglei Yi |
Average-Case Analysis for Special Cases of Online Bahncard Problem.  |
FSKD  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | David Hickey |
Distritrack: Automated Average-Case Analysis.  |
QEST  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Masoud Taghinezhad Omran |
Parallel Algorithm to Find Minimum Vertex Guard Set in a Triangulated Irregular Network.  |
PPAM  |
2007 |
DBLP DOI BibTeX RDF |
Art Gallery Problem, Guarding Problem, Approximation Algorithms, Parallel Computing, MPI, Graph Partitioning |
| 1 | Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik |
Why Almost All k -Colorable Graphs Are Easy.  |
STACS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jing-Chao Chen |
Efficient sample sort and the average case analysis of PEsort.  |
Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Moritz G. Maaß |
Average-Case Analysis of Approximate Trie Search.  |
Algorithmica  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tsung-Hsi Tsai |
Average case analysis of the Boyer-Moore algorithm.  |
Random Struct. Algorithms  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Keqin Li |
An average-case analysis of online non-clairvoyant scheduling of independent parallel tasks.  |
J. Parallel Distrib. Comput.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Lavault |
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Johann Blieberger |
Average case analysis of DJ graphs.  |
J. Discrete Algorithms  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Osamu Watanabe, Masaki Yamamoto |
Average-Case Analysis for the MAX-2SAT Problem.  |
SAT  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber |
On the Sum-of-Squares algorithm for bin packing.  |
J. ACM  |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithms, bin packing, average case analysis |
| 1 | René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking |
Computing equilibria for a service provider game with (Im)perfect information.  |
ACM Transactions on Algorithms  |
2006 |
DBLP DOI BibTeX RDF |
Market equilibria, service provider games, imperfect information |
| 1 | Jianxin Chen, Yuhang Yang, Hong Zhu, Peng Zeng |
A Bounded Item Bin Packing Problem over Discrete Distribution.  |
TAMC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki |
Matching Algorithms Are Fast in Sparse Random Graphs.  |
Theory Comput. Syst.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Orestis Telelis, Vassilis Zissimopoulos |
Absolute o(log m) error in approximating random set covering: an average case analysis.  |
Inf. Process. Lett.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémi Monasson |
A generating function method for the average-case analysis of DPLL  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Rémi Monasson |
A Generating Function Method for the Average-Case Analysis of DPLL.  |
APPROX-RANDOM  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang |
Average Case Analysis for Tree Labelling Schemes.  |
ISAAC  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Rubenstein, Sambit Sahu |
Can unstructured P2P protocols survive flash crowds?  |
IEEE/ACM Trans. Netw.  |
2005 |
DBLP DOI BibTeX RDF |
peer-to-peer, average case analysis, flash crowds |
| 1 | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
A Hard Dial-a-Ride Problem that is Easy on Average.  |
J. Scheduling  |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithm, NP-hard, average-case analysis |
| 1 | Djibo Karimou, Jean Frédéric Myoupo |
An Energy-Saving Algorithm for the Initialization of Single Hop Mobile Ad Hoc Networks.  |
ICW/ICHSN/ICMCS/SENET  |
2005 |
DBLP DOI BibTeX RDF |
Initialization Problem, Efficient-energy, Mobile Ad Hoc Network, Energy-saving |
| 1 | Sanguthevar Rajasekaran, Sandeep Sen |
PDM Sorting Algorithms That Take A Small Number of Passes.  |
IPDPS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Shang-Hua Teng |
Smoothed Analysis of Algorithms and Heuristics.  |
COCOON  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Witt |
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics.  |
STACS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis |
Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks.  |
MONET  |
2005 |
DBLP DOI BibTeX RDF |
simulation, wireless sensor networks, algorithms, stochastic processes, data propagation |
| 1 | Simona Cocco, Rémi Monasson |
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances.  |
Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Simona Cocco, Rémi Monasson |
Heuristic average-case analysis of the backtrack resolution of random 3-Satisfiability instances  |
CoRR  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Anup K. Sen, Amitava Bagchi, Weixiong Zhang |
Average-case analysis of best-first search in two representative directed acyclic graphs.  |
Artif. Intell.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | James Allen Fill, Svante Janson |
The number of bit comparisons used by Quicksort: an average-case analysis.  |
SODA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Moritz G. Maaß |
Average-Case Analysis of Approximate Trie Search (Extended Abstract).  |
CPM  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | David Gamarnik, Petar Momcilovic |
An asymptotic optimality of the transposition rule for linear lists.  |
SIGMETRICS Performance Evaluation Review  |
2004 |
DBLP DOI BibTeX RDF |
exclusion process, self-organizing list, average-case analysis |
Displaying result #1 - #100 of 234 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ >>] |
|