|
|
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 | Keqin Li |
On dynamic tree growing in hypercubes. |
SAC |
1997 |
DBLP DOI BibTeX RDF |
randomized tree embedding, hypercube, random walk, probabilistic analysis, recurrence relation, dynamic load distribution |
11 | Maria J. Serna, Fatos Xhafa |
The Parallel Approximability of a Subclass of Quadratic Programming. |
ICPADS |
1997 |
DBLP DOI BibTeX RDF |
Parallel Approximation Algorithms, De-randomization, Quadratic Programming, Randomized Rounding |
11 | Sanguthevar Rajasekaran |
Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting. |
IEEE Trans. Computers |
1996 |
DBLP DOI BibTeX RDF |
mesh with reconfigurable buses, mesh with fixed buses, k?k routing, k?k sorting, parallel computing, randomized algorithms, sorting, mesh, packet routing, Reconfigurable networks |
11 | Keqin Li 0001 |
Maintenance of tree structured computations on parallel and distributed computer systems. |
SAC |
1996 |
DBLP DOI BibTeX RDF |
randomized tree growing algorithm, performance analysis, recurrence relation, dynamic load distribution |
11 | Yuval Rabani |
Path Coloring on the Mesh. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
minimum path coloring problem, circuit routing, mesh, vertices, packet routing, graph colouring, randomized rounding, all-optical networks, path coloring |
11 | Michael Mitzenmacher |
Load Balancing and Density Dependent Jump Markov Processes (extended abstract). |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
density dependent jump Markov processes, dynamic randomized load balancing, Poisson stream, first-in first-out protocol, supermarket model, load balancing, protocols, servers, parallel processors, service time |
11 | Ming-Deh A. Huang, Yiu-Chung Wong |
Solving Systems of Polynomial Congruences Modulo a Large Prime (extended abstract). |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
polynomial congruences, algebraic homotopy method, algebraic set, computational complexity, randomized algorithm, decision, parallel complexity |
11 | Matthew Andrews, Baruch Awerbuch, Antonio Fernández 0001, Jon M. Kleinberg, Frank Thomson Leighton, Zhiyong Liu |
Universal Stability Results for Greedy Contention-Resolution Protocols. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
universal stability results, greedy contention-resolution protocols, packet generation, path determination, time-averaged injection rate, commonly-used protocols, n-node ring, distributed randomized greedy protocol, hypercubes, communication networks, FIFO, telecommunication networks, packet delay, adversarial model |
11 | Sridhar Rajagopalan, Leonard J. Schulman |
Verifying Identities (extended abstract). |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
time randomized algorithm, associative operation, c-ary operations, read-once identity, randomised algorithms, identity verification, optimal performance |
11 | Sanjeev Arora, Alan M. Frieze, Haim Kaplan |
A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
rounding procedure, dense graph arrangement, randomized procedure, fractional perfect matchings, LP rounding procedure, assignment problem, randomised algorithms, linear inequality |
11 | Michel X. Goemans, David P. Williamson |
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. |
J. ACM |
1995 |
DBLP DOI BibTeX RDF |
Approximation algorithms, randomized algorithms, satisfiability, convex optimization |
11 | Leila De Floriani, Paola Magillo |
Horizon computation on a hierarchical triangulated terrain model. |
Vis. Comput. |
1995 |
DBLP DOI BibTeX RDF |
Randomized algorithms, Visibility, Hierarchical models, Dynamic algorithms, Digital terrain models |
11 | Michael E. Saks, Shiyu Zhou |
RSPACE(S) \subseteq DSPACE(S3/2). |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
RSPACE(S), DSPACE(S/sup 3/2/), two-sided error, one-sided error algorithms, recursive matrix powering, two-sided error algorithms, natural recursive algorithm, probability, randomized algorithm, formal languages, deterministic algorithms, deterministic algorithm, pseudorandom generator, randomised algorithms, space bounded computation |
11 | Monika Rauch Henzinger, Valerie King |
Fully Dynamic Biconnectivity and Transitive Closure. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
fully dynamic biconnectivity, n-node graph, edge insertion, polylogarithmic time, Las-Vegas style, computational complexity, graph theory, randomized algorithm, transitive closure, deletion, randomised algorithms, dynamic algorithm, algorithm theory |
11 | Richard M. Karp, Orli Waarts, Geoffrey Zweig |
The Bit Vector Intersection Problem (Preliminary Version). |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
bit vector intersection, sparse bit vectors, dictionary matches, high probability, recursive tree-searching, randomized algorithms, hashing, tree data structures, randomised algorithms, algorithm theory |
11 | Martin Fürer |
Improved Hardness Results for Approximating the Chromatic Number. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
hardness results, chromatic number approximation, geometric proof, randomized twisting method, amortized free bits, polynomial lower bounds, computational complexity, graph theory, NP-hard, polynomial time algorithm, chromatic number |
11 | 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 |
11 | Richard M. Karp |
Probabilistic Recurrence Relations. |
J. ACM |
1994 |
DBLP DOI BibTeX RDF |
gambling games, randomized algorithms, probabilistic analysis, divide-and-conquer, recurrence relations |
11 | David R. Karger, Rajeev Motwani 0001, Madhu Sudan 0001 |
Approximate Graph Coloring by Semidefinite Programming |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
approximate graph coloring, k-colorable graphs, randomized polynomial time algorithm, semidefinite optimization problems, MAX 2-SAT problems, duality relationship, lower bounds, linear programs, semidefinite programming, vertices, chromatic number, MAX CUT, approximation ratio |
11 | Anil Kamath, Rajeev Motwani 0001, Krishna V. Palem, Paul G. Spirakis |
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
tail bounds, satisfiability threshold conjecture, random allocation, random 3-SAT formulas, randomized algorithms, upper bound, probabilistic analysis, structural property, occupancy |
11 | Carsten Lund, Steven J. Phillips, Nick Reingold |
IP over connection-oriented networks and distributional paging |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
distributional paging, holding policies, datagrams, page inter-request times, protocols, Asynchronous Transfer Mode, randomized algorithm, Internet protocol, probabilistic model, wide area network, deterministic algorithm, virtual circuits, connection-oriented networks |
11 | 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 |
11 | Ravi Kannan |
Markov Chains and Polynomial Time Algorithms |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
approximately certain, Markov Chains, randomized algorithms, polynomial time algorithms, perfect matchings, counting problems |
11 | Edith Cohen |
Estimating the Size of the Transitive Closure in Linear Time |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
size-estimation algorithms, reachability information, query optimization, randomized algorithm, directed graphs, transitive closure, database applications, neighborhoods, linear time, fast matrix multiplication |
11 | Sanguthevar Rajasekaran, Keith W. Ross |
Fast Algorithms for Generating Discrete Random Variates with Changing Distributions. |
ACM Trans. Model. Comput. Simul. |
1993 |
DBLP DOI BibTeX RDF |
randomized algorithms, queuing networks |
11 | Peter N. Yianilos |
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces. |
SODA |
1993 |
DBLP DOI BibTeX RDF |
randomized methods, clustering, pattern recognition, computational geometry, nearest neighbor, associative memory, metric space |
11 | Ming-Deh A. Huang, Doug Ierardi |
Counting Rational Points on Curves over Finite Fields (Extended Abstract) |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
rational points counting, homogeneous polynomial, projective plane curve, ordinary multiple points, rational points, randomized time, complexity, finite fields, curves |
11 | Edith Cohen |
Fast algorithms for constructing t-spanners and paths with stretch t |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
pairwise-covers, t-spanners constructions, paths with stretch, minimum-weight path, weighted undirected graph, exact shortest paths algorithms, randomized algorithm, deterministic algorithm, vertices, weighted graph |
11 | Robert Beals, László Babai |
Las Vegas algorithms for matrix groups |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
testing membership, composition factors, Sylow subgroups, Lie-type simple groups, number theoretic obstacles, randomized algorithm, permutation groups, finite groups, center, matrix groups, algebraic number fields, abelian groups, Las Vegas algorithms |
11 | Boris Aronov, Micha Sharir |
The Union of Convex Polyhedra in Three Dimensions |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
union of convex polyhedra, almost tight, edges, faces, vertices, three dimensions, randomized incremental algorithm |
11 | Micha Sharir |
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
almost tight upper bounds, higher dimensions, constant maximum degree, constant of proportionality, Davenport-Schinzel sequences, randomized algorithm, combinatorial complexity, lower envelopes, surface patches |
11 | Sridhar Rajagopalan, Vijay V. Vazirani |
Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
randomized voting, primal-dual RNC approximation algorithms, covering integer programs, classical greedy sequential set cover algorithm, parallel approximation algorithms, randomization, set cover problem |
11 | Bernd Gärtner |
A Subexponential Algorithm for Abstract Optimization Problems |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
smallest ball, subexponential algorithm, abstract optimization problems, oracle calls, subexponential bound, randomized algorithm, polyhedra, minimum distance |
11 | Christos H. Papadimitriou |
On Selecting a Satisfying Truth Assignment (Extended Abstract) |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
2SAT, satisfying truth assignment selection, natural generalizations, default preference, polynomial-time randomized algorithm, complexity, satisfiability, minimality, circumscription, selection criteria |
11 | Michael T. Goodrich |
Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation (Preliminary Version) |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
parallel computational geometry, randomized CRCW PRAM, parallel algorithms, approximation algorithms, processor allocation |
11 | Jirí Matousek 0001, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl |
Fat Triangles Determine Linearly Many Holes |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
fat triangles, linearly many holes, complexity, randomized algorithm, connected components |
11 | Otfried Schwarzkopf |
Dynamic Maintenance of Geometric Structures Made Easy |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
dynamic maintenance, Voronoi diagrams, convex hulls, insertions, deletions, geometric structures, randomized incremental algorithms, planar subdivisions, backwards analysis |
11 | Rajamani Sundar |
A Lower Bound for the Dictionary Problem under a Hashing Model |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
randomized complexities, update costs, deterministic complexities, constant amortized time, multilevel hashing model, log-algorithmic amortized time, nontrivial lower bound, limited wordsize, memory locations, data structures, polynomial space, dictionary problem, cell probe model |
11 | Frank Thomson Leighton, C. Greg Plaxton |
A (fairly) Simple Circuit that (usually) Sorts |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
strong ranking property, cube-connected, models, hypercube, randomized algorithm, parallel sorting, butterfly, shuffle-exchange |
11 | Amos Fiat, Yuval Rabani, Yiftach Ravid |
Competitive k-Server Algorithms (Extended Abstract) |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
k-taxicab, competitive k-server algorithms, three-server randomized competitive algorithm, nonconstructive proof, natural generalization, metric spaces |
11 | Rajeev Motwani 0001, Joseph Naor, Moni Naor |
The Probabilistic Method Yields Deterministic Parallel Algorithms |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
combinatorial constructions, randomized parallel algorithms, deterministic parallel algorithms, set balancing problem, lattice approximation, random sampling, conditional probabilities, probabilistic method, edge-coloring graphs |
11 | Seinosuke Toda |
On the Computational Power of PP and +P |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
two-sided bounded error probability, probabilistic Turing machine, (+)P, randomized polynomial-time reducibility, complexity classes, polynomial-time hierarchy, PH, PP |
11 | Ketan Mulmuley |
On Obstructions in Relation to a Fixed Viewpoint |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
obstructions, fixed viewpoint, combinatorial tool, mathematical series, complexity, randomized algorithms, Voronoi diagrams, hyperplanes, hidden surface removal, geometric problems |
11 | Bonnie Berger, John Rompel |
Simulating (log ^c n)-wise Independence in NC |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
hypergraph coloring problem, randomness removal, (log/sup c/n)-wise independence, randomized NC algorithms, polylogarithmic independence, RNC algorithms, set discrepancy problem, NC edge-coloring algorithm, simulation |
11 | László Babai, Lajos Rónyai |
Computing Irreducible Representations of Finite Groups |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
deterministic polynomial time, matrices list, randomized polynomial time, Las Vegas polynomial time, generators set, bit complexity, inequivalent irreducible representations, multiplication table, polynomial-size description, absolutely irreducible constituents, polynomial-time algorithm, equivalence class, finite groups, complex numbers, exact computations, algebraic number fields |
11 | Sandeep N. Bhatt, Jin-yi Cai |
Take a Walk, Grow a Tree (Preliminary Version) |
FOCS |
1988 |
DBLP DOI BibTeX RDF |
dynamically evolving binary trees, N-processor hypercube, tree nodes, tree-based computation, tree surgery, dependencies, randomized algorithm, random walks, hypercube networks, quadtrees, dynamic data structures, load-balancing algorithm |
11 | Michael Luby |
Removing Randomness in Parallel Computation Without a Processor Penalty |
FOCS |
1988 |
DBLP DOI BibTeX RDF |
maximal-matching problem, randomness removing, randomized NC algorithms, pairwise independence, concurrent-read-concurrent-write parallel random-access machine, maximal-independent-set problem, parallel algorithm, parallel computation, vertex coloring |
11 | Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan |
Dynamic Perfect Hashing: Upper and Lower Bounds |
FOCS |
1988 |
DBLP DOI BibTeX RDF |
dynamic perfect hashing, amortized expected time, amortized worst-case time complexity, lower bounds, randomized algorithm, upper bounds, deterministic algorithm, insertion, deletion, lookup, worst-case time, dictionary problem |
11 | Ketan Mulmuley |
A Fast Planar Partition Algorithm, I (Extended Abstract) |
FOCS |
1988 |
DBLP DOI BibTeX RDF |
global evolution, fast planar partition algorithm, fast randomized algorithm, linear segments, input segments, points of intersection, plane |
10 | David M. Mount, Eunhui Park |
A dynamic data structure for approximate range searching. |
SCG |
2010 |
DBLP DOI BibTeX RDF |
approximation algorithms, quadtrees, range searching, dynamic data structures, geometric data structures |
10 | Thomas Jansen 0001, Frank Neumann 0001 |
Computational complexity and evolutionary computation. |
GECCO (Companion) |
2010 |
DBLP DOI BibTeX RDF |
runtime analysis |
10 | James Aspnes |
A modular approach to shared-memory consensus, with applications to the probabilistic-write model. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
distributed computing, shared memory, randomization, consensus |
10 | Yuval Emek, Amos Korman |
Efficient threshold detection in a distributed environment: extended abstract. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
threshold detection, transmission complexity, message complexity |
10 | Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz |
Online set packing and competitive scheduling of multi-part tasks. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
multi-packet frames, online set packing, packet fragmentation, competitive analysis |
10 | Andronikos Nedos, Kulpreet Singh, Raymond Cunningham, Siobhán Clarke |
Probabilistic Discovery of Semantically Diverse Content in MANETs. |
IEEE Trans. Mob. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Troy Lee, Adi Shraibman |
Disjointness is Hard in the Multiparty Number-on-the-Forehead Model. |
Comput. Complex. |
2009 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
10 | Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz |
Resource Allocation in Bounded Degree Trees. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Bounded degree trees, Scheduling, Approximation algorithms, Bandwidth allocation, Storage allocation |
10 | Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano |
Degree-Optimal Routing for P2P Systems. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Peer-to-peer, Overlay network, Greedy routing |
10 | José R. Correa, Michael R. Wagner |
LP-based online scheduling: from single to parallel machines. |
Math. Program. |
2009 |
DBLP DOI BibTeX RDF |
Online algorithms, Machine scheduling |
10 | Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia |
On truthfulness and approximation for scheduling selfish tasks. |
J. Sched. |
2009 |
DBLP DOI BibTeX RDF |
Scheduling, Approximation algorithms, Game theory, Truthfulness |
10 | Li Chen 0002, Bin Fu |
Linear and Sublinear Time Algorithms for Basis of Abelian Groups. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke |
On the Advice Complexity of Online Problems. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Dov Monderer |
Monotonicity in Mechanism Design. |
SAGT |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Feng Pan 0012, Tim Converse, David Ahn, Franco Salvetti, Gianluca Donato |
Feature selection for ranking using boosted trees. |
CIKM |
2009 |
DBLP DOI BibTeX RDF |
boosted trees, information retrieval, feature selection |
10 | Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein |
On the approximability of Dodgson and Young elections. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Haim Kaplan, Natan Rubin, Micha Sharir |
Line transversals of convex polyhedra in R3. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Dugan Um, Handi Chandra Putra |
Manipulator path planning in unknown environments using model based planners: Conversion criteria and IPA sensor implementation. |
IROS |
2009 |
DBLP DOI BibTeX RDF |
|
10 | David Sheldon, Frank Vahid |
Making good points: application-specific pareto-point generation for design space exploration using statistical methods. |
FPGA |
2009 |
DBLP DOI BibTeX RDF |
configurable platform, fpga, low-power, exploration, speedup, pruning, pareto-optimal, design of experiments |
10 | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén |
Online Computation with Advice. |
ICALP (1) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Timothy M. Chan, Eric Y. Chen |
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection. |
SCG |
2009 |
DBLP DOI BibTeX RDF |
in-place algorithms, segment intersection, voronoi diagrams, convex hulls, cache-oblivious algorithms |
10 | Ron Bekkerman, Martin Scholz, Krishnamurthy Viswanathan |
Improving clustering stability with combinatorial MRFs. |
KDD |
2009 |
DBLP DOI BibTeX RDF |
clustering stability, combinatorial MRF, comraf |
10 | Erez Kantor, David Peleg |
Efficient k-Shot Broadcasting in Radio Networks. |
DISC |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Jean-Sébastien Coron, Avradip Mandal |
PSS Is Secure against Random Fault Attacks. |
ASIACRYPT |
2009 |
DBLP DOI BibTeX RDF |
Probabilistic Signature Scheme, Provable Security, Fault Attacks, Bellcore Attack |
10 | Mahdi Cheraghchi |
Noise-Resilient Group Testing: Limitations and Constructions. |
FCT |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Spyros Angelopoulos 0001 |
Online Priority Steiner Tree Problems. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Thomas Jansen 0001, Frank Neumann 0001 |
Computational complexity and evolutionary computation. |
GECCO (Companion) |
2009 |
DBLP DOI BibTeX RDF |
computational complexity, evolutionary computation |
10 | Michael D. Schmidt, Hod Lipson |
Incorporating expert knowledge in evolutionary search: a study of seeding methods. |
GECCO |
2009 |
DBLP DOI BibTeX RDF |
symbolic regression, prior knowledge |
10 | Mohammad Reza Reyhanitabar, Willy Susilo, Yi Mu 0001 |
Enhanced Target Collision Resistant Hash Functions Revisited. |
FSE |
2009 |
DBLP DOI BibTeX RDF |
TCR, eTCR, Hash Functions, CR, Domain Extension |
10 | Hui Li, Dario Landa Silva |
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem. |
EMO |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Matteo Centenaro, Riccardo Focardi, Flaminia L. Luccio, Graham Steel |
Type-Based Analysis of PIN Processing APIs. |
ESORICS |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Robin A. Moser |
A constructive proof of the Lovász local lemma. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
bounded occurrence sat instances, hypergraph colouring, derandomization, Lovasz local lemma |
10 | Qi Cheng 0001, Daqing Wan |
A deterministic reduction for the gap minimum distance problem: [extended abstract]. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
minimum distance problem, approximation algorithm, NP-complete, coding theory |
10 | Taehyung Lee, Joong Chae Na, Kunsoo Park |
On-Line Construction of Parameterized Suffix Trees. |
SPIRE |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Daniel Kunkle, Gene Cooperman |
Biased tadpoles: a fast algorithm for centralizers in large matrix groups. |
ISSAC |
2009 |
DBLP DOI BibTeX RDF |
conjugator, group order, tadpole, centralizer, matrix groups |
10 | José Elias Claudio Arroyo, Pedro Sampaio Vieira, Dalessandro Soares Vianna |
A GRASP algorithm for the multi-criteria minimum spanning tree problem. |
Ann. Oper. Res. |
2008 |
DBLP DOI BibTeX RDF |
GRASP algorithm, Multi-criteria combinatorial optimization, Minimum spanning tree |
10 | Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young |
Incremental Medians via Online Bidding. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Sanguthevar Rajasekaran, Sandeep Sen |
Optimal and Practical Algorithms for Sorting on the PDM. |
IEEE Trans. Computers |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz |
On the adaptiveness of Quicksort. |
ACM J. Exp. Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
Adaptive sorting, Quicksort, branch mispredictions |
10 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci |
Store-and-Forward Multicast Routing on the Mesh. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Parallel communication primitives, One-to-many routing, Multicast, Mesh architecture, Store-and-forward routing |
10 | Ying Wang 0021, Pierre Moulin |
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions. |
IEEE Trans. Inf. Theory |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Oliver Kosut, Lang Tong |
Distributed Source Coding in the Presence of Byzantine Sensors. |
IEEE Trans. Inf. Theory |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Damon Mosk-Aoyama, Devavrat Shah |
Fast Distributed Algorithms for Computing Separable Functions. |
IEEE Trans. Inf. Theory |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Hugues Mercier, Pierre McKenzie, Stefan Wolf 0001 |
Worst Case Nonzero-Error Interactive Communication. |
IEEE Trans. Inf. Theory |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Tino Teige, Martin Fränzle |
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic. |
CPAIOR |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Raghu G. Raj, Alan C. Bovik, Lawrence K. Cormack |
Fixation selection by maximization of texure and contrast information. |
ICIP |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan |
Is Shapley Cost Sharing Optimal? |
SAGT |
2008 |
DBLP DOI BibTeX RDF |
|
10 | James Aspnes, Muli Safra, Yitong Yin |
Ranged hash functions and the price of churn. |
SODA |
2008 |
DBLP BibTeX RDF |
|
10 | Tarun Bansal, Neeraj Mittal, Subbarayan Venkatesan |
Leader Election Algorithms for Multi-channel Wireless Networks. |
WASA |
2008 |
DBLP DOI BibTeX RDF |
wireless networks, cognitive radios, leader election, multiple channels |
10 | Rina Panigrahy, Kunal Talwar, Udi Wieder |
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden |
Truthful Approximation Schemes for Single-Parameter Agents. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
|
|