|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4201 occurrences of 1825 keywords
|
|
|
Results
Found 9721 publication records. Showing 9721 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
11 | Gianluca De Marco, Dariusz R. Kowalski |
Towards Power-Sensitive Communication on a Multiple-Access Channel. |
ICDCS |
2010 |
DBLP DOI BibTeX RDF |
combinatorial search theory, randomized algorithms, distributed learning, multiple-access channel |
11 | Vladimir Braverman, Rafail Ostrovsky |
Measuring independence of datasets. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
data streams, randomized algorithms, dimension reduction, theory of computation |
11 | Vladimir Braverman, Rafail Ostrovsky |
Zero-one frequency laws. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
data streams, randomized algorithms, theory of computation |
11 | Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti Rad, Morteza Zadimoghaddam |
Collaborative scoring with dishonest participants. |
SPAA |
2010 |
DBLP DOI BibTeX RDF |
fault tolerance, recommendation systems, collaborative filtering, randomized algorithms |
11 | Evangelos Triantaphyllou, Jennifer Austin-Rodriguez |
Optimization in Boolean Classification Problems. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Inductive inference problem, Boolean classification problem, Minimum number of clauses, One clause at a time approach, OCAT, GRASP approach, Randomized heuristics, Missing information, Unclassifiable examples, SAT, Learning algorithm, Medical diagnosis, Conjunctive normal form, CNF, Satisfiability problem, Disjunctive normal form, DNF |
11 | Stefan Voß 0001 |
Metaheuristics. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Pilot method, Optimization software library, POPMUSIC, Adaptive memory programming, Pool template, Genetic algorithm, Evolutionary algorithm, Heuristics, Simulated annealing, Tabu search, Metaheuristics, Hybridization, Variable neighborhood search, Scatter search, Greedy randomized adaptive search procedure |
11 | James M. Calvin |
Adaptive Global Search. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Randomized algorithms, Adaptive algorithm, Average case complexity, Wiener process |
11 | V. S. Anil Kumar 0001, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
Scheduling on Unrelated Machines under Tree-Like Precedence Constraints. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Precedence-constrained scheduling, Approximation algorithms, Randomized algorithms, Job-shop scheduling |
11 | V. S. Anil Kumar 0001, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan |
A unified approach to scheduling on unrelated parallel machines. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
scheduling under multiple criteria, Approximation algorithms, randomized rounding |
11 | Xiaoxia Wu, Paul Falkenstern, Krishnendu Chakrabarty, Yuan Xie 0001 |
Scan-chain design and optimization for three-dimensional integrated circuits. |
ACM J. Emerg. Technol. Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
scan-chain design, genetic algorithm, integer linear programming, randomized rounding, LP relaxation, 3D ICs |
11 | Raimund Seidel |
Maintaining Ideally Distributed Random Search Trees without Extra Space. |
Efficient Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Randomized Data Structures, Binary Search Trees |
11 | Sudarshan Vasudevan, Donald F. Towsley, Dennis Goeckel, Ramin Khalili |
Neighbor discovery in wireless networks and the coupon collector's problem. |
MobiCom |
2009 |
DBLP DOI BibTeX RDF |
sensor networks, ad hoc networks, randomized algorithms, initialization, neighbor discovery |
11 | Pankaj K. Agarwal, Esther Ezra, Micha Sharir |
Near-linear approximation algorithms for geometric hitting sets. |
SCG |
2009 |
DBLP DOI BibTeX RDF |
geometric range spaces, shallow cuttings, union of simply-shaped regions, randomized algorithms, hitting sets |
11 | Mark Burgin, Maurice J. Ades |
Monte Carlo methods and super-recursive algorithms. |
SpringSim |
2009 |
DBLP BibTeX RDF |
algorithm, randomized algorithm, Monte Carlo method, computer simulation, computing efficiency |
11 | Zvika Brakerski, Boaz Patt-Shamir |
Distributed discovery of large near-cliques. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
randomized algorithms, communication networks, property testing, clique |
11 | Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu |
Brief announcement: locality-based aggregate computation in wireless sensor networks. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
wireless sensor networks, distributed algorithm, randomized algorithm, gossip, random geometric graph, aggregate computation |
11 | Ravi Kannan, Hariharan Narayanan |
Random walks on polytopes and an affine interior point method for linear programming. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
optimization, randomized algorithms |
11 | Martin Dietzfelbinger, Ulf Schellbach |
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes. |
SOFSEM |
2009 |
DBLP DOI BibTeX RDF |
universal hash classes, data structures, lower bounds, randomized algorithms, cuckoo hashing |
11 | Aviv Nisgav, Boaz Patt-Shamir |
Finding similar users in social networks: extended abstract. |
SPAA |
2009 |
DBLP DOI BibTeX RDF |
collaboartive filtering, recommendation systems, randomized algorithms, market segmentation, user classification |
11 | Artur Czumaj, Christian Sohler |
Testing Euclidean minimum spanning trees in the plane. |
ACM Trans. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Euclidean minimum spanning tree, randomized algorithms, property testing |
11 | Maleq Khan, Gopal Pandurangan |
A fast distributed approximation algorithm for minimum spanning trees. |
Distributed Comput. |
2008 |
DBLP DOI BibTeX RDF |
Randomized algorithm, Minimum spanning tree, Distributed approximation algorithm |
11 | Zhi-Zhong Chen |
Approximation Algorithms for Bounded Degree Phylogenetic Roots. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Phylogenetic roots, Approximation algorithms, Randomized algorithms, Graph algorithms, Computational biology, Phylogenies |
11 | Chris Jermaine, Subramanian Arumugam 0002, Abhijit Pol, Alin Dobra |
Scalable approximate query processing with the DBO engine. |
ACM Trans. Database Syst. |
2008 |
DBLP DOI BibTeX RDF |
sampling, randomized algorithms, Online aggregation |
11 | Han Liu, Xiaodong Tu, Jun Xie |
Network Coding for P2P Live Media Streaming. |
NPC Workshops |
2008 |
DBLP DOI BibTeX RDF |
Randomized Network Coding, Mesh Cooperative, Streaming Continuity, Peer-to-Peer, Streaming |
11 | Markus Leitner, Günther R. Raidl |
Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks. |
Hybrid Metaheuristics |
2008 |
DBLP DOI BibTeX RDF |
Redundancy, Network Design, Lagrangian Relaxation, Variable Neighborhood Search, Steiner Tree Problem, Greedy Randomized Adaptive Search Procedure, Survivable Network Design |
11 | Chengming Qi, Shoumei Cui, Yunchuan Sun |
Using Ant Colony System and Local Search Methods to Solve VRPTW. |
PACIIA (2) |
2008 |
DBLP DOI BibTeX RDF |
Pareto local search, Randomized algorithm, Ant colony system, Vehicle routing problem with Time Windows |
11 | Yossi Borenstein |
An information perspective on evolutionary computation. |
GECCO (Companion) |
2008 |
DBLP DOI BibTeX RDF |
information theory, kolmogorov complexity, randomized search heuristics |
11 | Benjamin Doerr, Thomas Jansen 0001, Christian Klein 0001 |
Comparing global and local mutations on bit strings. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
randomized local search, evolutionary computation, analysis, mutation |
11 | Harry Buhrman, Michal Koucký 0001, Nikolai K. Vereshchagin |
Randomised Individual Communication Complexity. |
CCC |
2008 |
DBLP DOI BibTeX RDF |
individual communication complexity, Kolmogorov complexity, rounds, randomized protocols |
11 | Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan 0001 |
New Results on Noncommutative and Commutative Polynomial Identity Testing. |
CCC |
2008 |
DBLP DOI BibTeX RDF |
randomized, polynomial time, deterministic, polynomial identity testing |
11 | Shiping Chen 0002, Yuan Li, Kaihua Rao, Lei Zhao, Tao Li 0013, Shigang Chen |
Building a Scalable P2P Network with Small Routing Delay. |
APWeb |
2008 |
DBLP DOI BibTeX RDF |
Randomized Topology, Routing Delay, Peer-to-Peer Networks |
11 | Yaacov Fernandess, Dahlia Malkhi |
On spreading recommendations via social gossip. |
SPAA |
2008 |
DBLP DOI BibTeX RDF |
epidemic algorithms, message dissemination, randomized algorithms, gossip algorithms |
11 | Vitaliy B. Lvin, Gene Novark, Emery D. Berger, Benjamin G. Zorn |
Archipelago: trading address space for reliability and security. |
ASPLOS |
2008 |
DBLP DOI BibTeX RDF |
Archipelago, probabilistic memory safety, randomized algorithms, virtual memory, buffer overflow, dynamic memory allocation, memory errors |
11 | Philip M. Dorin |
Laboratory redux. |
ACM SIGCSE Bull. |
2007 |
DBLP DOI BibTeX RDF |
randomized estimation, dynamic programming, paradigms, discrete simulation |
11 | Mark Rudelson, Roman Vershynin |
Sampling from large matrices: An approach through geometric functional analysis. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
Randomized algorithms, singular-value decompositions, Monte-Carlo methods, massive data sets, low-rank approximations |
11 | Zhi-Zhong Chen, Takayuki Nagoya |
Improved approximation algorithms for metric MaxTSP. |
J. Comb. Optim. |
2007 |
DBLP DOI BibTeX RDF |
Max TSP, Metric Max TSP, Approximation Algorithms, Randomized Algorithms, TSP, Derandomization |
11 | Retsef Levi, Andrea Lodi 0001, Maxim Sviridenko |
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
scheduling theory and algorithms, approximation algorithms, integer programming, randomized algorithms, polyhedral combinatorics |
11 | Barbara M. Anthony, Anupam Gupta 0001 |
Infrastructure Leasing Problems. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
stochastic combinatorial optimization, Approximation algorithms, randomized algorithms, graph and network algorithms |
11 | ChenGuang Liu, Kazuyuki Tanaka |
Eigen-distribution on assignments for game trees with random properties. |
SAC |
2007 |
DBLP DOI BibTeX RDF |
distributional complexity, eigen-distribution, computational complexity, randomized algorithms, game trees |
11 | Christopher M. Jermaine, Subramanian Arumugam 0002, Abhijit Pol, Alin Dobra |
Scalable approximate query processing with the DBO engine. |
SIGMOD Conference |
2007 |
DBLP DOI BibTeX RDF |
DBO, sampling, randomized algorithms, online aggregation |
11 | Vladimir Marbukh, Stephan Klink |
Decentralized control of large-scale networks as a game with local interactions: cross-layer TCP/IP optimization. |
VALUETOOLS |
2007 |
DBLP DOI BibTeX RDF |
routing stability, optimization, game theory, TCP/IP, learning algorithms, distributed protocols, OSPF, randomized routing |
11 | Gene Novark, Emery D. Berger, Benjamin G. Zorn |
Exterminator: automatically correcting memory errors with high probability. |
PLDI |
2007 |
DBLP DOI BibTeX RDF |
dieFast, exterminator, randomized algorithms, error correction, probabilistic algorithms, dynamic memory allocation, memory errors |
11 | Arash Asadpour, Amin Saberi |
An approximation algorithm for max-min fair allocation of indivisible goods. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
approximation algorithms, game theory, randomized rounding |
11 | Gerold Jäger, Anand Srivastav, Katja Wolf |
Solving Generalized Maximum Dispersion with Linear Programming. |
AAIM |
2007 |
DBLP DOI BibTeX RDF |
Generalized Maximum Dispersion, Approximation Algorithms, Randomized Algorithms |
11 | Petra Berenbrink, Colin Cooper, Zengjian Hu |
Energy efficient randomised communication in unknown AdHoc networks. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
ad hoc networks, energy efficiency, broadcasting, randomized algorithms, gossiping |
11 | Bin Wu 0014, Ajay D. Kshemkalyani |
Objective-Optimal Algorithms for Long-Term Web Prefetching. |
IEEE Trans. Computers |
2006 |
DBLP DOI BibTeX RDF |
hit rate, optimal object selection, World Wide Web, randomized algorithm, bandwidth, Web server, Web caching, content distribution, Web prefetching, Web object |
11 | Filip Zelezný, Ashwin Srinivasan 0001, C. David Page Jr. |
Randomised restarted search in ILP. |
Mach. Learn. |
2006 |
DBLP DOI BibTeX RDF |
Monte carlo study, Inductive logic programming, Randomized search |
11 | David B. Shmoys, Chaitanya Swamy |
An approximation scheme for stochastic linear programming and its application to stochastic integer programs. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithms, randomized algorithms, convex optimization |
11 | Vinícius Amaral Armentano, Olinto César Bassi de Araújo |
Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times. |
J. Heuristics |
2006 |
DBLP DOI BibTeX RDF |
Memory mechanisms, Single machine scheduling, Setup times, Tardiness, Greedy randomized adaptive search procedures |
11 | Zhixiang Chen 0001, Bin Fu, Yong Tang 0001, Binhai Zhu |
A PTAS for a disc covering problem using width-bounded separators. |
J. Comb. Optim. |
2006 |
DBLP DOI BibTeX RDF |
Width-bounded separator, Disc covering, Approximation algorithms, Randomized algorithms |
11 | Dan Holtby, Bruce M. Kapron, Valerie King |
Lower bound for scalable Byzantine Agreement. |
PODC |
2006 |
DBLP DOI BibTeX RDF |
malicious adversary, non-adaptive adversary, scalable, distributed computing, lower bounds, randomized, Byzantine Agreement, probabilistic |
11 | Pieter-Tjerk de Boer, Dirk P. Kroese, Shie Mannor, Reuven Y. Rubinstein |
A Tutorial on the Cross-Entropy Method. |
Ann. Oper. Res. |
2005 |
DBLP DOI BibTeX RDF |
randomized optimization, machine learning, Monte-Carlo simulation, rare events, cross-entropy method |
11 | Hui Zhang 0002, Ashish Goel, Ramesh Govindan |
Improving lookup latency in distributed hash table systems using random sampling. |
IEEE/ACM Trans. Netw. |
2005 |
DBLP DOI BibTeX RDF |
latency expansion, latency stretch, peer-to-peer, randomized algorithm, distributed hash table (DHT), random sampling, internet topology |
11 | Chitta Baral, Tran Hoai Nam |
Representation and Reasoning about Evolutions of the World in the Context of Reasoning about Actions. |
Stud Logica |
2005 |
DBLP DOI BibTeX RDF |
triggered evolutions, probabilistic triggers, triggers, linear temporal logic, reasoning about actions, randomized strategies |
11 | Beomjoo Seo, Roger Zimmermann |
Efficient disk replacement and data migration algorithms for large disk subsystems. |
ACM Trans. Storage |
2005 |
DBLP DOI BibTeX RDF |
Disk replacement, randomized striping, data migration, storage resource management |
11 | Vincent A. Cicirello, Stephen F. Smith |
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics. |
J. Heuristics |
2005 |
DBLP DOI BibTeX RDF |
randomized heuristics, weighted tardiness scheduling, sequence-dependent setups, combinatorial optimization, stochastic search, stochastic sampling |
11 | Richard Cole 0001, Dennis E. Shasha, Xiaojian Zhao |
Fast window correlations over uncooperative time series. |
KDD |
2005 |
DBLP DOI BibTeX RDF |
time series, randomized algorithms, correlation |
11 | Laurent Fribourg, Stéphane Messika |
Brief announcement: coupling for Markov decision processes - application to self-stabilization with arbitrary schedulers. |
PODC |
2005 |
DBLP DOI BibTeX RDF |
fault tolerance, verification, correctness, rates of convergence, randomized distributed algorithms |
11 | Yossi Azar, Amir Epstein |
Convex programming for scheduling unrelated parallel machines. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
unrelated parallel machines, scheduling, approximation algorithms, randomized algorithms, convex programming |
11 | Piotr Sankowski |
Processor efficient parallel matching. |
SPAA |
2005 |
DBLP DOI BibTeX RDF |
polynomial matrix determinant, processor efficient, parallel algorithms, randomized algorithms, perfect matching, RNC |
11 | Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle |
Collaborate with strangers to find own preferences. |
SPAA |
2005 |
DBLP DOI BibTeX RDF |
recommendation systems, collaborative filtering, electronic commerce, randomized algorithms, probes, billboard |
11 | Bradford Hovinen, Wayne Eberly |
A reliable block Lanczos algorithm over small finite fields. |
ISSAC |
2005 |
DBLP DOI BibTeX RDF |
Lanczos algorithm, linear system solution, parallel computing, randomized algorithm, finite field, black box matrix |
11 | Petr Kolman, Christian Scheideler |
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Disjoint paths problem, Approximation, Randomized algorithms, Greedy algorithms, Unsplittable flow |
11 | Uriel Feige, László Lovász 0001, Prasad Tetali |
Approximating Min Sum Set Cover. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Threshhold, NP-hardness, Greedy algorithm, Randomized rounding |
11 | Minos N. Garofalakis, Phillip B. Gibbons |
Probabilistic wavelet synopses. |
ACM Trans. Database Syst. |
2004 |
DBLP DOI BibTeX RDF |
Wavelets, randomized rounding, approximate query processing, data synopses |
11 | Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastogi |
Tracking set-expression cardinalities over continuous update streams. |
VLDB J. |
2004 |
DBLP DOI BibTeX RDF |
Set expressions, Data streams, Randomized algorithms, Approximate query processing, Data synopses |
11 | Artur Czumaj, Christian Sohler |
Estimating the weight of metric minimum spanning trees in sublinear-time. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
approximations algorithms, randomized algorithms, minimum spanning tree, sublinear-time algorithms |
11 | Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan 0001, Martin Strauss 0001 |
One-Pass Wavelet Decompositions of Data Streams. |
IEEE Trans. Knowl. Data Eng. |
2003 |
DBLP DOI BibTeX RDF |
wavelets, Data streams, randomized algorithms, approximate queries |
11 | Bill Yuan-chi Chiu, Eamonn J. Keogh, Stefano Lonardi |
Probabilistic discovery of time series motifs. |
KDD |
2003 |
DBLP DOI BibTeX RDF |
data mining, time series, randomized algorithms, motifs |
11 | Suman Banerjee 0001, Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan |
Resilient multicast using overlays. |
SIGMETRICS |
2003 |
DBLP DOI BibTeX RDF |
randomized forwarding, resilience, overlay multicast |
11 | Robert D. Kleinberg, Frank Thomson Leighton |
Consistent load balancing via spread minimization. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
load balancing, randomized algorithms, on-line algorithms |
11 | Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor |
The online set cover problem. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
competitive analysis, on-line algorithms, set-cover, derandomization, randomized rounding |
11 | Roman Dementiev, Peter Sanders 0001 |
Asynchronous parallel disk sorting. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
algorithm library, external memory sorting, overlapping I/O and computation, randomized algorithm, prefetching, large data sets, algorithm engineering, parallel disks, secondary memory |
11 | Peter Sanders 0001, Sebastian Egner, Ludo M. G. M. Tolhuizen |
Polynomial time algorithms for network information flow. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
communication, multicasting, randomized algorithm, finite field, coding, linear algebra, derandomization, network information theory |
11 | Erich L. Kaltofen |
Polynomial factorization: a success story. |
ISSAC |
2003 |
DBLP DOI BibTeX RDF |
black box polynomial, randomized algorithm, polynomial factorization, lattice basis reduction, symbolic/numeric hybrid method, straight line program |
11 | Raymond T. Ng, Jiawei Han 0001 |
CLARANS: A Method for Clustering Objects for Spatial Data Mining. |
IEEE Trans. Knowl. Data Eng. |
2002 |
DBLP DOI BibTeX RDF |
computational geometry, clustering algorithms, Spatial data mining, randomized search |
11 | Michael Luby |
LT Codes. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
universal codes, reliable transport, balls and bins, randomized algorithms, erasure codes, rateless codes |
11 | Jacir Luiz Bordim, JiangTao Cui, Naohiro Ishii, Koji Nakano |
Doubly-Logarithmic Energy-Efficient Initialization Protocols for Single-Hop Radio Networks. |
IPDPS |
2002 |
DBLP DOI BibTeX RDF |
initialization protocols, energy-efficient, randomized algorithms, radio networks |
11 | Huan-Yu Tu, Lois Wright Hawkes |
Families of Optimal Fault-Tolerant Multiple-Bus Networks. |
IEEE Trans. Parallel Distributed Syst. |
2001 |
DBLP DOI BibTeX RDF |
partial-connection, multiple-bus, Fault tolerance, interconnection networks, multiprocessor, self-routing, randomized routing |
11 | Martin Skutella |
Convex quadratic and semidefinite programming relaxations in scheduling. |
J. ACM |
2001 |
DBLP DOI BibTeX RDF |
unrelated machines, approximation algorithms, randomized algorithms, convex optimization, performance guarantee, scheduling theory, worst-case ratio |
11 | Hadas Shachnai, Aravind Srinivasan |
Finding large independent sets of hypergraphs in parallel. |
SPAA |
2001 |
DBLP DOI BibTeX RDF |
parallel algorithms, randomized algorithms, hypergraphs, independent sets |
11 | Donald Kossmann, Konrad Stocker |
Iterative dynamic programming: a new class of query optimization algorithms. |
ACM Trans. Database Syst. |
2000 |
DBLP DOI BibTeX RDF |
iterative dynamic programming, plan evaluation function, randomized optimization, dynamic programming, query optimization, greedy algorithm |
11 | Jacobo Torán |
On the Hardness of Graph Isomorphism. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
logarithmic space many-one reductions, probabilistic logarithmic space, hardness results, randomized logarithmic space reduction, computational complexity, graph theory, encoding, determinant, graph isomorphism, perfect matching, complexity classes, hardness |
11 | Ravi Kannan, Santosh S. Vempala, Adrian Vetta |
On Clusterings - Good, Bad and Spectral. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
clustering quality assessment measure, worst-case guarantees, spectral algorithm, computational complexity, heuristic, randomized algorithm, polynomial time algorithms, spectral clustering, heuristic programming, randomised algorithms, pattern clustering |
11 | Ilan Newman |
Testing of Functions that have small width Branching Programs. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
small width branching programs, combinatorial property testing, read-once branching programs, computational complexity, probability, probability, Boolean functions, Boolean functions, randomized algorithm, directed graphs, regular languages, randomised algorithms, decision problems, query complexity |
11 | Camil Demetrescu, Giuseppe F. Italiano |
Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
fully dynamic transitive closure, unit worst-case cost, amortized time, single-operation complexity, subquadratic algorithm, computational complexity, randomized algorithm, queries, directed graphs, directed graphs, polynomials, polynomials, directed acyclic graphs, matrix multiplication, matrix multiplication, deterministic algorithms, deterministic algorithm, randomised algorithms |
11 | Adam Meyerson, Kamesh Munagala, Serge A. Plotkin |
Cost-Distance: Two Metric Network Design. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
cost-distance problem, 2-metric network design, edge cost sum optimization, source-sink distance sum optimization, randomized approximation scheme, source number, logarithmic approximation, single-sink buy-at-bulk problem, variable pipe types, single-source multicast trees, delay properties, multi-level facility location, computational complexity, trees (mathematics), cost, Steiner tree, facility location, telecommunication network routing, edges, approximation theory, randomised algorithms, network synthesis |
11 | Tsai-Yen Li, Hung-Kai Ting |
An Intelligent User Interface with Motion Planning for 3D Navigation. |
VR |
2000 |
DBLP DOI BibTeX RDF |
Randomized Roadmap, 3D Navigation Control, VRML, Path Planning, Intelligent User Interface |
11 | Luc Devroye |
A Note on the Expected Time for Finding Maxima by List Algorithms. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Outer layers, Maxima, List algorithms, Expected time, Randomized algorithms, Probabilistic analysis |
11 | Robert D. Blumofe, Charles E. Leiserson |
Scheduling Multithreaded Computations by Work Stealing. |
J. ACM |
1999 |
DBLP DOI BibTeX RDF |
critical-path length, multiprocessor, randomized algorithm, multithreading, work stealing, thread scheduling |
11 | Ziv Bar-Yossef, Oded Goldreich 0001, Avi Wigderson |
Deterministic Amplification of Space-Bounded Probabilistic Algorithms. |
CCC |
1999 |
DBLP DOI BibTeX RDF |
space bounded randomized computation, deterministic amplification, expander graphs |
11 | David J. Aldous |
A. Metropolis-Type Optimization Algorithm on the Infinite Tree. |
Algorithmica |
1998 |
DBLP DOI BibTeX RDF |
Randomized optimization algorithm, Random walk in random environment, Tree, Greedy algorithm, Probabilistic analysis, Metropolis algorithm |
11 | Michael E. Saks, Aravind Srinivasan, Shiyu Zhou |
Explicit OR-Dispersers with Polylogarithmic Degree. |
J. ACM |
1998 |
DBLP DOI BibTeX RDF |
hashing lemmas, imperfect sources of randomness, measures of information, hardness of approximation, derandomization, expander graphs, time-space tradeoffs, pseudo-random generators, explicit constructions, randomized computation |
11 | Pankaj K. Agarwal, Micha Sharir |
Efficient Algorithms for Geometric Optimization. |
ACM Comput. Surv. |
1998 |
DBLP DOI BibTeX RDF |
proximity problems, prune-and-search, clustering, linear programming, randomized algorithms, collision detection, parametric searching, matrix searching |
11 | Robert A. McLaughlin, Michael D. Alder |
The Hough Transform Versus the UpWrite. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1998 |
DBLP DOI BibTeX RDF |
probabilistic Hough transform, hierarchical Hough transform, UpWrite, Hough transform, randomized Hough transform |
11 | Martin Skutella |
Semidefinite Relaxations for Parallel Machine Scheduling. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
scheduling, approximation algorithms, randomized algorithms, semidefinite programming, convex programming |
11 | Uri Zwick |
All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
Bridging sets, Randomized algorithms, Shortest paths, Matrix multiplication |
11 | Shlomi Dolev, Amos Israeli, Shlomo Moran |
Uniform Dynamic Self-Stabilizing Leader Election. |
IEEE Trans. Parallel Distributed Syst. |
1997 |
DBLP DOI BibTeX RDF |
distributed algorithms, synchronization, leader election, Self-stabilizing systems, randomized distributed algorithms |
11 | Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal |
How much can hardware help routing? |
J. ACM |
1997 |
DBLP DOI BibTeX RDF |
randomized routing algorithms, single-port, packet routing, permutation routing, multi-port |
11 | David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu |
A Practical Approximation Algorithm for the LMS Line Estimator. |
SODA |
1997 |
DBLP DOI BibTeX RDF |
least median-of-squares regression, line arrangements, approximation algorithms, randomized algorithms, robust estimation, line fitting |
|
|