|
|
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 |
23 | Jiejun Kong, Xiaoyan Hong, Mario Gerla |
Modeling Ad-hoc rushing attack in a negligibility-based security framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Wireless Security ![In: Proceedings of the 2006 ACM Workshop on Wireless Security, Los Angeles, California, USA, September 29, 2006, pp. 55-64, 2006, ACM, 1-59593-557-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
asymptotic invariant, neg-ligibility, randomized network algorithms, randomized turing machine, sub-polynomial, scalability |
23 | Aravind Srinivasan, Chung-Piaw Teo |
A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997, pp. 636-643, 1997, ACM, 0-89791-888-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
covering integer programs, discrete ham-sandwich theorems, rounding theorems, approximation algorithms, linear programming, randomized algorithms, packet routing, randomized rounding |
23 | Yair Bartal |
Probabilistic Approximations of Metric Spaces and Its Algorithmic Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 184-193, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
randomized performance ratio, metrical task systems, server problems, distributed paging, dynamic storage rearrangement, randomized algorithms, metric spaces, deterministic algorithms, optimization problems, competitive ratio, randomised algorithms |
23 | Sanjeev Mahajan, Ramesh Hariharan |
Derandomizing Semidefinite Programming Based Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 162-169, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat |
23 | Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis |
A Unified Geometric Approach to Graph Separators ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 538-547, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
randomized NC algorithms, geometric embedding, randomized linear time algorithms, k-overlap graphs, k-nearest neighbor graphs, separator bound, finite element methods, planar graphs, graph separators |
22 | Yu Zheng 0001, Ming C. Lin, Dinesh Manocha |
Efficient simplex computation for fixture layout design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Solid and Physical Modeling ![In: ACM Symposium on Solid and Physical Modeling, Proceedings of the 15th ACM Symposium on Solid and Physical Modeling, SPM 2010, Haifa, Israel, September 1-3, 2010, pp. 71-80, 2010, ACM, 978-1-60558-984-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
layout design, randomized algorithms, simplex, fixture |
22 | Yunlong Liu 0001, Jianer Chen, Jianxin Wang 0001 |
On Counting 3-D Matchings of Size k. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(4), pp. 530-543, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
3-D matching, Counting complexity, Approximation algorithm, Randomized algorithm, Parameterized algorithm |
22 | Jianer Chen, Songjian Lu |
Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(4), pp. 472-489, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Set splitting, Parametrized algorithm, Randomized algorithm, Derandomization |
22 | Jérémy Barbay, Claire Kenyon |
Alternation and redundancy analysis of the intersection problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(1), pp. 4:1-4:18, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Adaptive analysis, alternation analysis, intersection of sorted arrays, randomized algorithm, intersection, redundancy analysis |
22 | Akiko Suzuki, Takeshi Tokuyama |
Dense subgraph problems with output-density conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(4), pp. 43:1-43:18, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, Combinatorial optimization, randomized algorithms, dense subgraph |
22 | Nima Sarshar, Behnam Attaran Rezaei, Vwani P. Roychowdhury |
Low latency wireless ad hoc networking: power and bandwidth challenges and a solution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 16(2), pp. 335-346, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
multi-resolution randomized hierarchy, wireless ad hoc networks, network latency, scalable routing |
22 | Shengzhong Yuan, Hong He |
A Probabilistic Method to Estimate Life Expectancy of Application Software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2008, 5th International Symposium on Neural Networks, ISNN 2008, Beijing, China, September 24-28, 2008, Proceedings, Part I, pp. 417-421, 2008, Springer, 978-3-540-87731-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Life expectancy, Weibull probability map, Probabilistic method, Randomized protocol, Network application |
22 | Cheng Xing, Jianqiang Wang |
An Improved Method for Circle Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIRA (1) ![In: Intelligent Robotics and Applications, First International Conference, ICIRA 2008, Wuhan, China, October 15-17, 2008 Proceedings, Part I, pp. 463-468, 2008, Springer, 978-3-540-88512-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
circle detection, sub-pixel, randomized Hough transform |
22 | Nicholas B. Chang, Mingyan Liu |
Controlled flooding search in a large network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 15(2), pp. 436-449, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
best worst-case performance, controlled flooding search, query and search, wireless networks, competitive ratio, time-to-live (TTL), randomized strategy |
22 | Vlady Ravelomanana |
Optimal Initialization and Gossiping Algorithms for Random Radio Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 18(1), pp. 17-28, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
self-configuration in ad hoc networks, randomized distributed protocols, fundamental limits of random radio networks, broadcasting, gossiping, initialization, information dissemination, naming, Multihop networks |
22 | Fredrik Manne, Qin Xin 0001 |
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAN ![In: Combinatorial and Algorithmic Aspects of Networking, Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers, pp. 125-134, 2006, Springer, 3-540-48822-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Centralized radio networks, randomized schedule, gossiping |
22 | Damon Mosk-Aoyama, Devavrat Shah |
Computing separable functions via gossip. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006, pp. 113-122, 2006, ACM, 1-59593-384-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
randomized algorithms, gossip, data aggregation |
22 | Giulia Galbiati, Francesco Maffioli |
Approximating Maximum Cut with Limited Unbalance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers, pp. 202-213, 2006, Springer, 3-540-69513-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithm, randomized algorithm, semidefinite programming |
22 | Tae Hyun Kim 0003, Tsuyoshi Takagi, Dong-Guk Han, Ho Won Kim 0001, Jongin Lim 0001 |
Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CANS ![In: Cryptology and Network Security, 5th International Conference, CANS 2006, Suzhou, China, December 8-10, 2006, Proceedings, pp. 168-181, 2006, Springer, 3-540-49462-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Randomized projective coordinate systems, Eta pairing, Side channel attacks, Differential Power Analysis, Pairing based cryptosystems |
22 | Joachim Gehweiler, Christiane Lammersen, Christian Sohler |
A distributed O(1)-approximation algorithm for the uniform facility location problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 237-243, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
distributed approximation, randomized algorithm, facility location |
22 | Taejoon Park, Kang G. Shin |
Soft Tamper-Proofing via Program Integrity Verification in Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 4(3), pp. 297-309, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
program-integrity verification, a randomized hash function, sensor networks, Tamper-proofing |
22 | Dariusz R. Kowalski, Andrzej Pelc |
Broadcasting in undirected ad hoc radio networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 18(1), pp. 43-57, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Broadcasting, Distributed, Randomized, Radio network, Deterministic |
22 | Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama |
A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 42(2), pp. 141-158, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Asian option, Binomial tree model, Approximation algorithm, Randomized algorithm, Option pricing |
22 | Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane |
An improved exponential-time algorithm for k-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(3), pp. 337-364, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
CNF satisfiability, randomized algorithms |
22 | Jong Hoon Shin, Dong Jin Park, Pil Joong Lee |
DPA Attack on the Improved Ha-Moon Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WISA ![In: Information Security Applications, 6th International Workshop, WISA 2005, Jeju Island, Korea, August 22-24, 2005, Revised Selected Papers, pp. 283-291, 2005, Springer, 3-540-31012-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Ha-Moon algorithm, randomized exponentiation algorithm, side-channel attack |
22 | Luca Becchetti, Stefano Leonardi 0001 |
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(4), pp. 517-539, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
multilevel feedback, randomized algorithms, Probabilistic analysis, flow time |
22 | Peter Damaschke |
Scheduling Search Procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 7(5), pp. 349-364, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
randomized adversary, searching, on-line algorithms, Bayesian models |
22 | Sanguthevar Rajasekaran, Jaime I. Dávila |
A Fundamental Problem in Computer and Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 10th International Conference on Parallel and Distributed Systems, ICPADS 2004, Newport Beach, CA, USA, July 7-9, 2004, pp. 81-, 2004, IEEE Computer Society, 0-7695-2152-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Partitioned Optical Passive Star (POPS) network, partial permutation routing, sparse enumeration sort, randomized algorithms, selection, packet routing |
22 | Colin D. Walter |
Issues of Security with the Oswald-Aigner Exponentiation Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CT-RSA ![In: Topics in Cryptology - CT-RSA 2004, The Cryptographers' Track at the RSA Conference 2004, San Francisco, CA, USA, February 23-27, 2004, Proceedings, pp. 208-221, 2004, Springer, 3-540-20996-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Addition-subtraction chains, randomized exponentiation, elliptic curve cryptography, ECC, DPA, blinding, power analysis, smartcard, SPA, DEMA, point multiplication, SEMA |
22 | Wanpracha Art Chaovalitwongse, Dukwon Kim, Panos M. Pardalos |
GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(2), pp. 179-207, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
vehicle routing with time windows, local search, greedy randomized adaptive search procedure |
22 | Surender Baswana, Sandeep Sen |
A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 384-296, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Randomized algorithms, Shortest path, Graph algorithms |
22 | Nina Amenta, Sunghee Choi, Günter Rote |
Incremental constructions con BRIO. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003, pp. 211-219, 2003, ACM, 1-58113-663-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
randomized incremental construction, delaunay triangulation, virtual memory |
22 | Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman |
Work-competitive scheduling for cooperative computing with dynamic groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 251-258, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
partitionable networks, distributed computation, randomized algorithms, competitive analysis, on-line algorithms, independent tasks, work complexity |
22 | Anupam Gupta 0001, Amit Kumar 0001, Tim Roughgarden |
Simpler and better approximation algorithms for network design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 365-372, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
approximation algorithms, randomized algorithms, network design |
22 | Martin Dietzfelbinger, Torben Hagerup |
Simple Minimal Perfect Hashing in Less Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 109-120, 2001, Springer, 3-540-42493-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
minimal perfect hash functions, space requirements, Data structures, randomized algorithms, hashing, dictionaries, hash tables |
22 | Thorsten Behrens, Karl Rohr, H. Siegfried Stiehl |
Segmentation of Tubular Structures in 3D Images Using a Combination of the Hough Transform and a Kalman Filter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAGM-Symposium ![In: Pattern Recognition, 23rd DAGM-Symposium, Munich, Germany, September 12-14, 2001, Proceedings, pp. 406-413, 2001, Springer, 3-540-42596-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
3D tubular structure segmentation, minimal user interaction, randomized Hough transform (RHT), Kalman filter-based tracking, 3D medical images |
22 | Karl Aberer |
P-Grid: A Self-Organizing Access Structure for P2P Information Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoopIS ![In: Cooperative Information Systems, 9th International Conference, CoopIS 2001, Trento, Italy, September 5-7, 2001, Proceedings, pp. 179-194, 2001, Springer, 3-540-42524-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Distributed Databases, Randomized Algorithms, Peer-To-Peer computing, Distributed Indexing |
22 | Reuven Bar-Yehuda |
One for the Price of Two: a Unified Approach for Approximating Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 27(2), pp. 131-144, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Generalized Steiner Forest, Randomized approximations, Approximation algorithm, Set Cover, Vertex Cover, Covering problems, Primal-dual, Local ratio, Feedback Vertex Set |
22 | Helena Handschuh, Yiannis Tsiounis, Moti Yung |
Decision Oracles are Equivalent to Matching Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography, Second International Workshop on Practice and Theory in Public Key Cryptography, PKC '99, Kamakura, Japan, March 1-3, 1999, Proceedings, pp. 276-289, 1999, Springer, 3-540-65644-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Diffie-Hellman variants, randomized reductions, uniform reductions, homomorphic encryption functions (ElGamal, Goldwasser-Micali, Okamoto-Uchiyama, Naccache-Stern), random self-reducibility, universal malleability, public-key encryption, decision problems, matching problems |
22 | Ramamohan Paturi, Pavel Pudlák, Francis Zane |
Satisfiability Coding Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 566-574, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
satisfying assignments, satisfying assignment, Satisfiability Coding Lemma, computability, randomized algorithm, satisfiability, deterministic algorithm, conjunctive normal form, Boolean formulae |
22 | Sarvar Patel |
Number Theoretic Attacks on Secure Password Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
S&P ![In: 1997 IEEE Symposium on Security and Privacy, May 4-7, 1997, Oakland, CA, USA, pp. 236-247, 1997, IEEE Computer Society, 0-8186-7828-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
number theoretic attacks, secure password schemes, Encrypted Key Exchange, EKE, authenticated information exchange, insecure network, secret key cryptography, randomized confounders, RSA version, half encrypted versions, Direct Authentication Protocol, Secret Public Key Protocol versions, secure protocols, message authentication, dictionary attacks, active attacks, password guessing attacks |
22 | Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka |
Practical Algorithms for Selection on Coarse-Grained Parallel Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '96, The 10th International Parallel Processing Symposium, April 15-19, 1996, Honolulu, Hawaii, USA, pp. 309-313, 1996, IEEE Computer Society, 0-8186-7255-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
coarse-grained parallel computers, randomized algorithms, distributed memory systems, deterministic algorithms, deterministic algorithms, randomised algorithms, distributed memory parallel computers, CM-5 |
22 | Mitchell Flatebo, Ajoy Kumar Datta |
Two-State Self-Stabilizing Algorithms for Token Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(6), pp. 500-504, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
two-state self-stabilizing algorithms, legal state, illegal state, infrequent errors, randomized central demon, asynchronous unidirectional ring, binary state machines, distributed system, reliability, distributed algorithms, distributed algorithms, fault tolerant computing, probability, local area networks, probabilistic algorithm, network connections, token rings, token networks, mutual exclusion algorithms |
22 | Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing |
On the Construction of Abstract Voronoi Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings, pp. 227-239, 1990, Springer, 3-540-52282-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
randomized algorithms, Voronoi diagrams |
21 | Thomas Jansen 0001, Christine Zarges |
Aging beyond restarts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010, pp. 705-712, 2010, ACM, 978-1-4503-0072-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
genetic algorithms, evolutionary algorithms, aging, crossover, runtime analysis, immune algorithms |
21 | Ling Guo, Songtao Guo, Xintao Wu |
On Addressing Accuracy Concerns in Privacy Preserving Association Rule Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 12th Pacific-Asia Conference, PAKDD 2008, Osaka, Japan, May 20-23, 2008 Proceedings, pp. 124-135, 2008, Springer, 978-3-540-68124-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Vikraman Arvind, Partha Mukhopadhyay |
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 276-289, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Dieter van Melkebeek, Konstantin Pervyshev |
A Generic Time Hierarchy with One Bit of Advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(2), pp. 139-179, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q15, 68Q10 |
21 | Mikkel Thorup |
Equivalence between priority queues and sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(6), pp. 28, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
sorting, Priority queues |
21 | Ling Guo, Songtao Guo, Xintao Wu |
Privacy Preserving Market Basket Data Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PKDD ![In: Knowledge Discovery in Databases: PKDD 2007, 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings, pp. 103-114, 2007, Springer, 978-3-540-74975-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Ahuva Mu'alem, Michael Schapira |
Setting lower bounds on truthfulness: extended abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 1143-1152, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
21 | Jianer Chen, Songjian Lu, Sing-Hoi Sze, Fenghui Zhang |
Improved algorithms for path, matching, and packing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 298-307, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
21 | Alessandro Mei, Romeo Rizzi |
Online Permutation Routing in Partitioned Optical Passive Star Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 55(12), pp. 1557-1571, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
partitioned optical passive star network, Optical interconnections, permutation routing |
21 | Shafi Goldwasser, Elan Pavlov, Vinod Vaikuntanathan |
Fault-Tolerant Distributed Computing in Full-Information Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 15-26, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Henri Koskinen |
Analytical study of connectivity in wireless multihop networks utilizing beamforming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MSWiM ![In: Proceedings of the 9th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2006, Terromolinos, Spain, October 2-6, 2006, pp. 212-218, 2006, ACM, 1-59593-477-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
sensor networks, ad hoc networks, connectivity, random graphs, beamforming, wireless multihop networks |
21 | Yang Liu 0002, Songjian Lu, Jianer Chen, Sing-Hoi Sze |
Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings, pp. 84-95, 2006, Springer, 3-540-39098-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Markus Schmidt 0003 |
Packet Buffering: Randomization Beats Deterministic Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings, pp. 293-304, 2005, Springer, 3-540-24998-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Noga Alon, Yossi Azar, Shai Gutner |
Admission control to minimize rejections and online set cover with repetitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 238-244, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
admission control, competitive, set cover, on-line |
21 | Angelos Stavrou, Dan Rubenstein, Sambit Sahu |
A lightweight, robust P2P system to handle flash crowds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 22(1), pp. 6-17, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Alexandre V. Evfimievski, Johannes Gehrke, Ramakrishnan Srikant |
Limiting privacy breaches in privacy preserving data mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA, pp. 211-222, 2003, ACM, 1-58113-670-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Hartmut Klauck |
Rectangle Size Bounds and Threshold Covers in Communication Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark, pp. 118-134, 2003, IEEE Computer Society, 0-7695-1879-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Xiaotie Deng |
Distributed Near-Optimal Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 135-144, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
20 | Tao Shu, Marwan Krunz, Sisi Liu |
Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 9(7), pp. 941-954, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Randomized multipath routing, secure data delivery, wireless sensor network |
20 | David Doty |
Randomized Self-Assembly for Exact Shapes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 85-94, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
tile concentration programming, randomized algorithm, self-assembly, molecular computation |
20 | Ming-Yang Kao, Robert T. Schweller |
Randomized Self-assembly for Approximate Shapes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 370-384, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Approximation Algorithms, Randomized Algorithms, Self-Assembly |
20 | Yanping Zhang, Yang Xiao 0001, Kui Wu 0001, Xiaojiang Du, Bo Sun 0001 |
Three Dimensional Intrusion Objects Detection under Randomized Scheduling Algorithm in Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MSN ![In: MSN 2008, The 4th International Conference on Mobile Ad-hoc and Sensor Networks, Wuhan, China, December 10-12, 2008, pp. 16-22, 2008, IEEE Computer Society, 978-0-7695-3457-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Randomized Scheduling Algorithm, Sensor Networks, Intrusion Detection, Three Dimensional |
20 | Frank Neumann 0001, Joachim Reichel, Martin Skutella |
Computing minimum cuts by randomized search heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 779-786, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minimum s-t-cuts, evolutionary algorithms, multi-objective optimization, randomized search heuristics |
20 | Nicola Fanizzi, Claudia d'Amato, Floriana Esposito |
Randomized metric induction and evolutionary conceptual clustering for semantic knowledge bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, CIKM 2007, Lisbon, Portugal, November 6-10, 2007, pp. 51-60, 2007, ACM, 978-1-59593-803-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
randomized optimization, evolutionary algorithms, genetic programming, unsupervised learning, description logics, conceptual clustering, metric learning |
20 | Vasil Mizorov, Jörg Widmer, Robert Vilzmann, Petri Mähönen |
Flooding Speed in Wireless Multihop Networks with Randomized Beamforming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networking ![In: NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet, 6th International IFIP-TC6 Networking Conference, Atlanta, GA, USA, May 14-18, 2007, Proceedings, pp. 25-36, 2007, Springer, 978-3-540-72605-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
randomized beamforming, flooding speed, Ad Hoc Networks, antenna arrays |
20 | Xuan Hoai Nguyen, Quang Uy Nguyen, Robert I. McKay |
PSO with randomized low-discrepancy sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, pp. 173, 2007, ACM, 978-1-59593-697-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
randomized Halton sequence, particle swarm optimization |
20 | Gopal Pandurangan, GaHyun Park |
Brief announcement: analysis of a randomized contention-resolution protocol for distributed access. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005, pp. 274, 2005, ACM, 1-58113-994-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
local distributed protocols, load balancing, probabilistic analysis, randomized protocols, contention-resolution |
20 | Konstantin Avrachenkov, Nikita O. Vilchevsky, Georgy L. Shevlyakov |
Priority queueing with finite buffer size and randomized push-out mechanism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: Proceedings of the International Conference on Measurements and Modeling of Computer Systems, SIGMETRICS 2003, June 9-14, 2003, San Diego, CA, USA, pp. 324-325, 2003, ACM, 1-58113-664-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
randomized push-out, DiffServ, priority queueing, finite buffer, packet loss probability |
20 | Jens Gustedt |
Randomized permutations in a coarse grained parallel environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 248-249, 2003, ACM, 1-58113-661-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
uniformly generated communication matrix, coarse grained parallelism, randomized permutations |
20 | Achour Mostéfaoui, Michel Raynal |
Randomized k-set agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001, pp. 291-297, 2001, ACM, 1-58113-409-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
fault-tolerance, consensus, asynchronous system, randomized protocol, k-set Agreement |
20 | Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee |
Super-linear time-space tradeoff lower bounds for randomized computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 169-179, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
super-linear time-space tradeoff lower bounds, deterministic RAM algorithms, deterministic Boolean branching programs, computational complexity, lower bound, probability, randomised algorithms, decision problems, branching program, time-space tradeoff, randomized computation |
20 | Robert D. Carr, Santosh S. Vempala |
Randomized metarounding (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, pp. 58-62, 2000, ACM, 1-58113-184-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
polyhedra, randomized rounding, integrality gap |
20 | Sangman Bak, Jorge Arturo Cobb |
Randomized Distance-Vector Routing Protocol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 1999 ACM Symposium on Applied Computing, SAC'99, San Antonio, Texas, USA, February 28 - March 2, 1999, pp. 78-84, 1999, ACM, 1-58113-086-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
randomized distance-vector routing, load balancing, effective bandwidth, shortest path routing, network throughput |
20 | Jaafar Gaber, Bernard Toursel |
Randomized load distribution of arbitrary trees in distributed networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 1998 ACM symposium on Applied Computing, SAC'98, Atlanta, GA, USA, February 27 - March 1, 1998, pp. 564-568, 1998, ACM, 0-89791-969-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
randomized embedding, parallel algorithms, tree structures, dynamic load distribution |
20 | Keqin Li |
Deterministic and randomized algorithms for distributed on-line task assignment and load balancing without load status information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 1998 ACM symposium on Applied Computing, SAC'98, Atlanta, GA, USA, February 27 - March 1, 1998, pp. 613-622, 1998, ACM, 0-89791-969-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
on-line task assignment, load balancing, randomized algorithm, deterministic algorithm |
20 | Pascal Koiran |
Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 36-45, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Arthur-Merlin class, Generalized Riemann Hypothesis, complexity, NP-complete, randomized algorithms, deterministic algorithms, deterministic algorithms, algebraic varieties |
20 | Bernd Gärtner, Günter M. Ziegler |
Randomized Simplex Algorithms on Klee-Mintny Cubes ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 502-510, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
quadratic worst-case behavior, randomized simplex algorithms, Klee-Minty cubes, quadratic lower bounds, quadratic upper bounds, complexity, linear programs, combinatorial models |
20 | Sunil Arya, David M. Mount, Michiel H. M. Smid |
Randomized and deterministic algorithms for geometric spanners of small diameter ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 703-712, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
randomized algorithms, directed graph, deterministic algorithms, insertions, deletions, geometric spanners |
20 | László Lovász 0001, Miklós Simonovits |
On the Randomized Complexity of Volume and Diameter ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 482-491, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
unit ball, randomized complexity, mixing rate, Markov chains, random walks, diameter, volume, convex polytopes, convex body |
20 | Ketan Mulmuley |
Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 90-100, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
expected running times, computational geometry, Voronoi diagram, pseudo-random generators, convex polytope, Quicksort, randomized incremental algorithms |
20 | James Aspnes, Orli Waarts |
Randomized Consensus in Expected O(n log ^2 n) Operations Per Processor ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 137-146, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
martingale arguments, asynchronous processors, worst case expected bound, shared coin protocol, randomized algorithm, consensus, reading, writing, shared registers |
20 | Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks |
A Decomposition Theorem and Bounds for Randomized Server Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 197-207, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
randomized server problems, k-server problem, arbitrary metric spaces, lower bound, motion-planning, bounds, competitive ratio, decomposition theorem |
20 | Ketan Mulmuley |
Randomized Multidimensional Search Trees: Further Results in Dynamic Sampling (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 216-227, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
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 |
20 | Joseph Cheriyan, Torben Hagerup |
A Randomized Maximum-Flow Algorithm ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 118-123, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
dynamic trees data structure, randomized maximum-flow algorithm, prudent linking excess diminishing, negligible probability, maximum flow excess, PLED algorithm, parameter, worst case, vertex |
19 | Danny Hendler, Philipp Woelfel |
Adaptive randomized mutual exclusion in sub-logarithmic expected time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 141-150, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
rmrs, adaptive, distributed algorithms, mutual exclusion, remote memory references |
19 | Jorge L. Piovesan, Herbert G. Tanner |
Randomized model predictive control for robot navigation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICRA ![In: 2009 IEEE International Conference on Robotics and Automation, ICRA 2009, Kobe, Japan, May 12-17, 2009, pp. 94-99, 2009, IEEE. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Baharak Rastegari, Anne Condon, Kevin Leyton-Brown |
Stepwise randomized combinatorial auctions achieve revenue monotonicity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 738-747, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Danny Hendler, Philipp Woelfel |
Randomized mutual exclusion in O(log N / log log N) RMRs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 26-35, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
remote memory references (RMRS), mutual exclusion |
19 | Christopher Kiekintveld, Manish Jain, Jason Tsai, James Pita, Fernando Ordóñez, Milind Tambe |
Computing optimal randomized resource allocations for massive security games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS (1) ![In: 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), Budapest, Hungary, May 10-15, 2009, Volume 1, pp. 689-696, 2009, IFAAMAS, 978-0-9817381-6-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
patrolling, security, algorithms, game theory, uncertainty, randomization, risk analysis, Stackelberg games |
19 | Fabio Fagnani, Sandro Zampieri |
Randomized consensus algorithms over large scale networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 26(4), pp. 634-649, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Ondrej Chum, Jiri Matas |
Optimal Randomized RANSAC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 30(8), pp. 1472-1482, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Aleksey Golovinskiy, Thomas A. Funkhouser |
Randomized cuts for 3D mesh analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 27(5), pp. 145, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
shape analysis, mesh segmentation |
19 | Akira Matsubayashi, Yasuyuki Kawamura |
Randomized Online File Allocation on Uniform Ring Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPDC ![In: 7th International Symposium on Parallel and Distributed Computing (ISPDC 2008), 1-5 July 2008, Krakow, Poland, pp. 449-453, 2008, IEEE Computer Society, 978-0-7695-3472-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Zhengli Huang, Wenliang Du |
OptRR: Optimizing Randomized Response Schemes for Privacy-Preserving Data Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 24th International Conference on Data Engineering, ICDE 2008, April 7-12, 2008, Cancún, Mexico, pp. 705-714, 2008, IEEE Computer Society, 978-1-4244-1836-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Seungwon Choi, Dong-Jo Park |
Performance of Randomized Cyclic Delay Code Encoded by Convolutional Coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTC Spring ![In: Proceedings of the 67th IEEE Vehicular Technology Conference, VTC Spring 2008, 11-14 May 2008, Singapore, pp. 2370-2373, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara |
Randomized Competitive Analysis for Two-Server Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pp. 161-172, 2008, Springer, 978-3-540-87743-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #201 - #300 of 9721 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|