|
|
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 |
58 | Artur Czumaj, Wojciech Rytter |
Broadcasting Algorithms in Radio Networks with Unknown Topology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 492-501, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
58 | Benjamin Doerr |
Structured Randomized Rounding and Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 461-471, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
hypergraph coloring, randomized algorithms, integer linear programming, discrepancy, randomized rounding |
56 | Neha Rungta, Eric G. Mercer |
Generating Counter-Examples Through Randomized Guided Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIN ![In: Model Checking Software, 14th International SPIN Workshop, Berlin, Germany, July 1-3, 2007, Proceedings, pp. 39-57, 2007, Springer, 978-3-540-73369-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
49 | Benjamin Doerr |
Analyzing Randomized Search Heuristics: Tools from Probability Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory of Randomized Search Heuristics ![In: Theory of Randomized Search Heuristics: Foundations and Recent Developments., pp. 1-20, 2011, World Scientific, 978-981-4282-66-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
49 | Martin E. Dyer, Mark Jerrum, Marek Karpinski |
08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Design and Analysis of Randomized and Approximation Algorithms ![In: Design and Analysis of Randomized and Approximation Algorithms, 11.05. - 16.05.2008, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
49 | Martin E. Dyer, Mark Jerrum, Marek Karpinski |
05201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Design and Analysis of Randomized and Approximation Algorithms ![In: Design and Analysis of Randomized and Approximation Algorithms, 15.05. - 20.05.2005, 2005, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
47 | Amit Chakrabarti, Subhash Khot |
Improved Lower Bounds on the Randomized Complexity of Graph Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 285-296, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Decision tree complexity, monotone graph properties, randomized complexity, graph packing, randomized algorithms, probabilistic method |
46 | Joffroy Beauquier, Maria Gradinariu, Colette Johnen |
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 20(1), pp. 75-93, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Scheduler, Self-stabilization, Leader election, Randomized protocol, Protocol composition |
46 | Amalia Duch |
Randomized Insertion and Deletion in Point Quad Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 415-426, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Randomized Algorithms, Quad trees |
46 | Benjamin Doerr, Henning Schnieder |
Non-independent Randomized Rounding and an Application to Digital Halftoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 399-410, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
discrepancy, Randomized rounding, digital halftoning |
46 | Juraj Hromkovic |
Randomized Communication Protocols (A Survey). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001, Proceedings, pp. 1-32, 2001, Springer, 3-540-43025-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
two-party protocols, communication complexity, Randomized computing |
46 | Rusins Freivalds, Marek Karpinski |
Lower Space Bounds for Randomized Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 580-592, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
43 | Valeri Korjik, Guillermo Morales-Luna |
Information Hiding through Noisy Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Information Hiding ![In: Information Hiding, 4th International Workshop, IHW 2001, Pittsburgh, PA, USA, April 25-27, 2001, Proceedings, pp. 42-50, 2001, Springer, 3-540-42733-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
cover message, wire-trap channel concept, information-theoretically secure model, randomized encoding, linear binary codes, Information hiding |
41 | Maury Bramson, Yi Lu 0001, Balaji Prabhakar |
Randomized load balancing with general service time distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: SIGMETRICS 2010, Proceedings of the 2010 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, New York, New York, USA, 14-18 June 2010, pp. 275-286, 2010, ACM, 978-1-4503-0038-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
asymptotic independence, load balancing, randomized algorithms |
41 | Yumao Lu, Vwani P. Roychowdhury |
Parallel randomized sampling for support vector machine (SVM) and support vector regression (SVR). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 14(2), pp. 233-247, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Support vector machine, Parallel algorithm, Support vector regression, Randomized sampling |
41 | Oliver Giel, Ingo Wegener |
Maximum cardinality matchings on trees by randomized local search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006, pp. 539-546, 2006, ACM, 1-59593-186-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
maximum cardinality matchings, randomized local search, evolutionary algorithms, runtime analysis |
41 | James H. Andrews, Susmita Haldar, Yong Lei, Felix Chun Hang Li |
Tool support for randomized unit testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Testing ![In: Proceedings of the 1st International Workshop on Random Testing, RT 2006, Portland, Maine, USA, July 20, 2006, pp. 36-45, 2006, ACM, 1-59593-457-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
randomized testing, unit testing |
41 | Hiroyuki Miyazawa, Thomas Erlebach |
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 7(4), pp. 293-311, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
interval scheduling, lower bound, randomized algorithm, competitive analysis, upper bound, on-line algorithm |
41 | Keqin Li |
On the Performance of Randomized Embedding of Reproduction Trees in Static Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Parallel Program. ![In: Int. J. Parallel Program. 31(5), pp. 393-406, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
randomized tree embedding, reproduction tree, static network, dynamic load distribution |
41 | Osamu Watanabe 0001, Takeshi Sawai, Hayato Takahashi 0001 |
Analysis of Randomized Local Search Algorithm for LDPCC Decoding Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings, pp. 50-60, 2003, Springer, 3-540-20103-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
LDPCC decoding, Local search, randomized algorithms, constraint satisfaction |
41 | Katsuyuki Okeya, Kunihiko Miyazaki, Kouichi Sakurai |
A Fast Scalar Multiplication Method with Randomized Projective Coordinates on a Montgomery-Form Elliptic Curve Secure against Side Channel Attacks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICISC ![In: Information Security and Cryptology - ICISC 2001, 4th International Conference Seoul, Korea, December 6-7, 2001, Proceedings, pp. 428-439, 2001, Springer, 3-540-43319-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Montgomery Form, Randomized Projective Coordinates, Side Channel Attacks, Elliptic Curve Cryptosystem |
41 | Pietro S. Oliveto, Xin Yao 0001 |
Runtime Analysis of Evolutionary Algorithms for Discrete Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory of Randomized Search Heuristics ![In: Theory of Randomized Search Heuristics: Foundations and Recent Developments., pp. 21-52, 2011, World Scientific, 978-981-4282-66-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
41 | Carsten Witt |
Theory of Particle Swarm Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory of Randomized Search Heuristics ![In: Theory of Randomized Search Heuristics: Foundations and Recent Developments., pp. 197-223, 2011, World Scientific, 978-981-4282-66-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
41 | L. Darrell Whitley, Jonathan E. Rowe |
A "No Free Lunch" Tutorial: Sharpened and Focused No Free Lunch. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory of Randomized Search Heuristics ![In: Theory of Randomized Search Heuristics: Foundations and Recent Developments., pp. 255-287, 2011, World Scientific, 978-981-4282-66-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
41 | Dimo Brockhoff |
Theoretical Aspects of Evolutionary Multiobjective Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory of Randomized Search Heuristics ![In: Theory of Randomized Search Heuristics: Foundations and Recent Developments., pp. 101-139, 2011, World Scientific, 978-981-4282-66-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
41 | Daniel Johannsen |
Evolutionary Computation in Combinatorial Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory of Randomized Search Heuristics ![In: Theory of Randomized Search Heuristics: Foundations and Recent Developments., pp. 53-99, 2011, World Scientific, 978-981-4282-66-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
41 | Thomas Jansen 0001 |
Simulated Annealing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory of Randomized Search Heuristics ![In: Theory of Randomized Search Heuristics: Foundations and Recent Developments., pp. 171-195, 2011, World Scientific, 978-981-4282-66-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
41 | Walter J. Gutjahr |
Ant Colony Optimization: Recent Developments in Theoretical Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory of Randomized Search Heuristics ![In: Theory of Randomized Search Heuristics: Foundations and Recent Developments., pp. 225-254, 2011, World Scientific, 978-981-4282-66-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
41 | Dirk Sudholt |
Memetic Evolutionary Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory of Randomized Search Heuristics ![In: Theory of Randomized Search Heuristics: Foundations and Recent Developments., pp. 141-169, 2011, World Scientific, 978-981-4282-66-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
41 | Anne Auger, Nikolaus Hansen |
Theory of Evolution Strategies: A New Perspective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory of Randomized Search Heuristics ![In: Theory of Randomized Search Heuristics: Foundations and Recent Developments., pp. 289-325, 2011, World Scientific, 978-981-4282-66-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
41 | Olivier Teytaud |
Lower Bounds for Evolution Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory of Randomized Search Heuristics ![In: Theory of Randomized Search Heuristics: Foundations and Recent Developments., pp. 327-354, 2011, World Scientific, 978-981-4282-66-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
41 | Martin E. Dyer, Mark Jerrum, Marek Karpinski (eds.) |
Design and Analysis of Randomized and Approximation Algorithms, 11.05. - 16.05.2008 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Design and Analysis of Randomized and Approximation Algorithms ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
41 | Martin E. Dyer, Mark Jerrum, Marek Karpinski (eds.) |
Design and Analysis of Randomized and Approximation Algorithms, 15.05. - 20.05.2005 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Design and Analysis of Randomized and Approximation Algorithms ![Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
40 | Gurmeet Singh Manku, Moni Naor, Udi Wieder |
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 54-63, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
random structures, peer to peer networks, greedy routing |
40 | Ingo Wegener |
Towards a Theory of Randomized Search Heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings, pp. 125-141, 2003, Springer, 3-540-40671-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
39 | Alexandre Fonte, José Martins, Marília Curado, Edmundo Monteiro |
Stabilizing Intelligent Route Control: Randomized Path Monitoring, Randomized Path Switching or History-Aware Path Switching?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MMNS ![In: Management of Converged Multimedia Networks and Services, 11th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services, MMNS 2008, Samos Island, Greece, September 22-26, 2008. Proceedings, pp. 151-156, 2008, Springer, 978-3-540-87358-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
38 | GuoJun Wang, Xiao-Jing Hui |
Randomization of classical inference patterns and its application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 50(6), pp. 867-877, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
D-randomized mapping, D-randomized truth degree, D-similarity, D-logic metric space, approximate reasoning |
38 | Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri |
Communication in dynamic radio networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pp. 205-214, 2007, ACM, 978-1-59593-616-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
randomized algorithms, radio networks |
38 | Sumit Gulwani, George C. Necula |
Precise interprocedural analysis using random interpretation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, Long Beach, California, USA, January 12-14, 2005, pp. 324-337, 2005, ACM, 1-58113-830-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
interprocedural value numbering, linear relationships, random interpretation, randomized algorithm, interprocedural analysis, uninterpreted functions |
38 | Erich Novak, Ian H. Sloan, Henryk Wozniakowski |
Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 4(2), pp. 121-156, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Korobov spaces, Approximation, Randomized algorithms, Quantum computation, Tractability |
38 | Katsuyuki Okeya, Kouichi Sakurai |
On Insecurity of the Side Channel Attack Countermeasure Using Addition-Subtraction Chains under Distinguishability between Addition and Doubling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 7th Australian Conference, ACISP 2002, Melbourne, Australia, July 3-5, 2002, Proceedings, pp. 420-435, 2002, Springer, 3-540-43861-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Randomized Addition-Subtraction Chains Countermeasure, SPA Attack, Side Channel Attacks, Elliptic Curve Cryptosystems, Timing Attack |
38 | Allan Borodin, Ran El-Yaniv |
On Ranomization in Online Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 226-238, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
randomized online algorithms, competitive performance, Yao Principle, game theory, randomization, minimization, randomised algorithms, online computation, maximization, paging algorithms |
37 | Leah Epstein, Asaf Levin |
On the Max Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers, pp. 142-155, 2007, Springer, 978-3-540-77917-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis |
Oblivious gossiping in ad-hoc radio networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DIAL-M ![In: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), Rome, Italy, July 21, 2001, pp. 44-51, 2001, ACM. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
37 | Daniel J. Challou, Maria L. Gini, Vipin Kumar 0001, George Karypis |
Predicting the Performance of Randomized Parallel Search: An Application to Robot Motion Planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 38(1), pp. 31-53, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
randomized path planning, randomized parallel search, performance evaluation, parallel computers |
37 | Xiaotie Deng, Binhai Zhu |
A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors. ![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. 192-198, 1996, IEEE Computer Society, 0-8186-7255-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
coarse grained multiprocessors, randomized parallel algorithm, local operations, global-operations, messages per processor, global data dependency, communication phases, parallel algorithms, computational complexity, computational geometry, probability, randomized algorithm, Voronoi diagram, parallel machines, computation time, line segments, randomised algorithms, random-access storage, CRCW PRAM model |
37 | Daniel Barbará, Richard J. Lipton |
A Class of Randomized Strategies for Low-Cost Comparison of File Copies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 2(2), pp. 160-170, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
file copies, randomized signatures, remotely located file copies, differing pages, security of data, file organisation, algorithm theory, randomized strategies |
36 | Keren Censor-Hillel |
Multi-sided shared coins and randomized set-agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010, pp. 60-68, 2010, ACM, 978-1-4503-0079-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
multi-valued shared coins, distributed computing, randomized algorithms, shared memory, set-agreement |
36 | Xin He, Tao Luo 0005, Jianfeng Li 0004, Guangxin Yue, Hao Zhao |
Randomized space-time block coding with limited feedback. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, IWCMC 2009, Leipzig, Germany, June 21-24, 2009, pp. 522-526, 2009, ACM, 978-1-60558-569-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
limited feedback, randomized STBC, cooperative relay |
36 | Travis Atkison |
Applying randomized projection to aid prediction algorithms in detecting high-dimensional rogue applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 47th Annual Southeast Regional Conference, 2009, Clemson, South Carolina, USA, March 19-21, 2009, 2009, ACM, 978-1-60558-421-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
n-gram analysis, rogue software detection, information retrieval, randomized projections, cosine similarity |
36 | Chadi Kari, Alexander Russell, Narasimha K. Shashidhar |
Randomized Work-Competitive Scheduling for Cooperative Computing on k-partite Task Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NCA ![In: Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, NCA 2008, July 10-12, 2008, Cambridge, Massachusetts, USA, pp. 267-270, 2008, IEEE Computer Society, 978-0-7695-3192-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
partitionable networks, distributed computing, randomized algorithms, competitive analysis, On-line algorithms |
36 | Abraham Sánchez López, Maria A. Osorio |
On the Use of Randomized Low-Discrepancy Sequences in Sampling-Based Motion Planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI ![In: MICAI 2005: Advances in Artificial Intelligence, 4th Mexican International Conference on Artificial Intelligence, Monterrey, Mexico, November 14-18, 2005, Proceedings, pp. 980-989, 2005, Springer, 3-540-29896-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Sampling-based motion planning, randomized Halton sequence, deterministic sampling |
36 | Nir Andelman |
Randomized queue management for DiffServ. ![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. 1-10, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
randomized algorithms, online algorithms, competitive analysis, active queue management |
36 | Spyros A. Reveliotis, Jin Young Choi 0001 |
On the Optimality of Randomized Deadlock Avoidance Policies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 13(4), pp. 303-320, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
sequential resource allocation systems, controlled Markov chains, randomized control policies, deadlock resolution |
36 | Dong-Guk Han, Nam Su Chang, Seok Won Jung, Young-Ho Park 0001, Chang Han Kim, Heuisu Ryu |
Cryptanalysis of the Full Version Randomized Addition-Subtraction Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 8th Australasian Conference, ACISP 2003, Wollongong, Australia, July 9-11, 2003, Proceedings, pp. 67-78, 2003, Springer, 3-540-40515-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
SPA attack, Randomized addition-subtraction chains countermeasure, Side-channel attack, Elliptic curve cryptosystems |
36 | Paul D. Ezhilchelvan, Achour Mostéfaoui, Michel Raynal |
Randomized Multivalued Consensus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISORC ![In: 4th International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2001), 2-4 May 2001, Magdeburg, Germany, pp. 195-200, 2001, IEEE Computer Society, 0-7695-1089-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Fault-Tolerance, Message Passing, Asynchronous Distributed System, Random Number, Crash Failure, Unreliable Failure Detector, Consensus Problem, Randomized Protocol |
36 | Martin Sauerhoff |
Randomized Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001, Proceedings, pp. 65-72, 2001, Springer, 3-540-43025-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Randomized branching program, read-k-times, linear-length, lower bounds, randomness, nondeterminism, OBDD |
36 | László Babai, Peter G. Kimmel |
Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 239-246, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
randomized simultaneous messages, two-player communication model, deterministic SM complexity, quadratic reduction, lower bound proof, computational complexity, communication complexity, linear algebra |
35 | Russell Impagliazzo |
Can every randomized algorithm be derandomized? ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 373-374, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
algebraic circuit complexity, probabilistic algorithms, derandomization, circuit complexity, complexity classes, pseudo-randomness |
35 | Haiying Shen, Cheng-Zhong Xu 0001 |
Locality-Aware Randomized Load Balancing Algorithms for DHT Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 34th International Conference on Parallel Processing (ICPP 2005), 14-17 June 2005, Oslo, Norway, pp. 529-536, 2005, IEEE Computer Society, 0-7695-2380-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Martin Sauerhoff |
On the size of randomized OBDDs and read-once branching programs for k-stable functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 10(2), pp. 155-178, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
read-once branching program, zero error, lower bounds, randomness, communication complexity, OBDD |
35 | Faith E. Fich, Maurice Herlihy, Nir Shavit |
On the Space Complexity of Randomized Synchronization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(5), pp. 843-862, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
lower bounds, consensus, space complexity |
35 | Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez |
Randomized K-Dimensional Binary Search Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 199-208, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
35 | Rusins Freivalds, Marek Karpinski |
Lower Time Bounds for Randomized Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings, pp. 183-195, 1995, Springer, 3-540-60084-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
35 | Marek Karpinski, Rutger Verbeek |
On Randomized Versus Deterministic Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings, pp. 227-240, 1993, Springer, 3-540-56939-1. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
31 | Richard M. Karp, Christian Schindelhauer, Scott Shenker, Berthold Vöcking |
Randomized Rumor Spreading. ![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. 565-574, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
randomized rumor spreading, epidemic algorithms, lazy update transmission, distributed database copies, randomized communication mechanism, parallel rounds, randomly selected communication partner, address-oblivious algorithm, random telephone calls, commmunication complexity, robustness, lower bound, information theory, communication complexity, database theory, time optimality, communication overhead, communication optimality, randomised algorithms, replicated databases, message transmissions |
31 | Lasse Kliemann, Anand Srivastav |
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEA ![In: Experimental Algorithms, 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings, pp. 185-196, 2009, Springer, 978-3-642-02010-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
hypergraph matching, approximation algorithms, greedy algorithms, hybrid algorithms, NP-hard problems, randomized rounding |
31 | Tobias Friedrich 0001, Thomas Sauerwald |
Near-perfect load balancing by randomized rounding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 121-130, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
load balancing, randomized rounding |
31 | Hagit Attiya, Keren Censor |
Tight bounds for asynchronous randomized consensus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 55(5), pp. 20:1-20:26, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Distributed computing, lower bound, randomized algorithms, shared-memory, isoperimetric inequality |
31 | Heng Yang 0003, Qing Wang 0006, Zhoucan He |
Randomized sub-vectors hashing for high-dimensional image feature matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Multimedia ![In: Proceedings of the 16th International Conference on Multimedia 2008, Vancouver, British Columbia, Canada, October 26-31, 2008, pp. 705-708, 2008, ACM, 978-1-60558-303-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
high-dimensional feature matching, randomized sub-vectors hashing, nearest neighbor searching |
31 | Hagit Attiya, Keren Censor |
Tight bounds for asynchronous randomized consensus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 155-164, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
distributed computing, lower bound, randomized algorithms, shared-memory, isoperimetric inequality |
31 | Ralph Guderlei, Johannes Mayer, Christoph Schneckenburger, Frank Fleischer |
Testing randomized software by means of statistical hypothesis tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOQUA ![In: Fourth International Workshop on Software Quality Assurance, SOQUA 2007, in conjunction with the 6th ESEC/FSE joint meeting, Dubrovnik, Croatia, September 3-4, 2007, pp. 46-54, 2007, ACM, 978-1-59593-724-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
randomized software, test oracle, test evaluation, statistical hypothesis test |
31 | Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu |
Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 17(9), pp. 987-1000, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
data query, fault tolerance, sensor networks, distributed algorithms, graph theory, aggregate, randomized algorithms, stochastic processes, Probabilistic algorithms |
31 | Shengyu Zhang |
New upper and lower bounds for randomized and quantum local search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 634-643, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
query complexity (decision tree complexity), lower bound, local search, randomized algorithm, quantum algorithm |
31 | Tien-Ching Lin, D. T. Lee |
Randomized Algorithm for the Sum Selection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 515-523, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
order-statistic tree, k maximum sums problem, sum selection problem, maximum sum problem, maximum sum subarray problem, computational geometry, randomized algorithm, random sampling |
31 | Thomas Fevens, Alaa Eddien Abdallah, Badr Naciri Bennani |
Randomized AB-Face-AB Routing Algorithms in Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADHOC-NOW ![In: Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, ADHOC-NOW 2005, Cancun, Mexico, October 6-8, 2005, Proceedings, pp. 43-56, 2005, Springer, 3-540-29132-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mobile adhoc networks, position-based routing, randomized routing |
31 | Rodrigue Ossamy |
A Simple Randomized k-Local Election Algorithm for Local Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings, pp. 290-301, 2005, Springer, 3-540-25920-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
election in graphs, distributed algorithms, randomized algorithms, Local computations |
31 | Ling Cheung |
Randomized Wait-Free Consensus Using an Atomicity Assumption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 9th International Conference, OPODIS 2005, Pisa, Italy, December 12-14, 2005, Revised Selected Papers, pp. 47-60, 2005, Springer, 3-540-36321-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Asynchronous Consensus, Wait-Free Termination, Weak Adversary, Randomized Algorithms, Probabilistic Model Checking |
31 | Nipoon Malhotra, Shrish Ranjan, Saurabh Bagchi |
LRRM: A Randomized Reliable Multicast Protocol for Optimizing Recovery Latency and Buffer Utilization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SRDS ![In: 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005),26-28 October 2005, Orlando, FL, USA, pp. 215-225, 2005, IEEE Computer Society, 0-7695-2463-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Recovery latency, Tree-based multicast protocols, Reliable multicast, Randomized protocols, Buffer utilization |
31 | Sung-Ming Yen, Chien-Ning Chen, Sang-Jae Moon, JaeCheol Ha |
Improvement on Ha-Moon Randomized Exponentiation Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICISC ![In: Information Security and Cryptology - ICISC 2004, 7th International Conference, Seoul, Korea, December 2-3, 2004, Revised Selected Papers, pp. 154-167, 2004, Springer, 3-540-26226-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Randomized recoding, Signed-digit recoding, Side-channel attack, Differential power analysis (DPA), Simple power analysis (SPA), Modular exponentiation, Physical cryptanalysis |
31 | Konstantinos Psounis, Balaji Prabhakar |
Efficient randomized web-cache replacement schemes using samples from past eviction times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 10(4), pp. 441-455, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
cache replacement scheme, past samples, World Wide Web (WWW), randomized algorithm, web caching |
31 | Victor Y. Pan |
Randomized Acceleration of Fundamental Matrix Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 215-226, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Matrix determinant, minimum polynomial, Smith invariant factors, Frobenius invariant factors, bit-operation complexity, block Wiedemann algorithm, randomized algorithms, characteristic polynomial |
31 | Marta Z. Kwiatkowska, Gethin Norman |
Verifying Randomized Byzantine Agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORTE ![In: Formal Techniques for Networked and Distributed Systems - FORTE 2002, 22nd IFIP WG 6.1 International Conference Houston, Texas, USA, November 11-14, 2002, Proceedings, pp. 194-209, 2002, Springer, 3-540-00141-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Induction and compositional model checking, probabilistic model checking, randomized distributed algorithms |
31 | Arjun Singh, William J. Dally, Brian Towles, Amit K. Gupta |
Locality-preserving randomized oblivious routing on torus networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002, pp. 9-13, 2002, ACM, 1-58113-529-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
locality-preserving, oblivious packet routing, interconnection networks, randomized, k-ary n cubes |
31 | Dima Grigoriev |
Complexity lower bounds for randomized computation trees over zero characteristic fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 8(4), pp. 316-329, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Randomized computation trees, multiplicative complexity, distinctness problem, knapsack problem |
30 | Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, Fukuhito Ooshita |
Randomized Gathering of Mobile Robots with Local-Multiplicity Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, pp. 384-398, 2009, Springer, 978-3-642-05117-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Marios Mavronicolas, Thomas Sauerwald |
A randomized, o(log w)-depth 2 smoothing network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, pp. 178-187, 2009, ACM, 978-1-60558-606-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
smoothing network, load balancing, probabilistic analysis |
30 | Jenn-Wei Lin, Yi-Ting Chen |
Improving the coverage of randomized scheduling in wireless sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 7(12-1), pp. 4807-4812, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Seth Pettie, Vijaya Ramachandran |
Randomized minimum spanning tree algorithms using exponentially fewer random bits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(1), pp. 5:1-5:27, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Graph algorithms, minimum spanning trees, random sampling |
30 | Nikhil Bansal 0001, Niv Buchbinder, Joseph Naor |
A Primal-Dual Randomized Algorithm for Weighted Paging. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 507-517, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Xi Chen 0001, Shang-Hua Teng |
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 124-134, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Jeffrey Scott Vitter, David A. Hutchinson |
Distribution sort with randomized cycling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(4), pp. 656-680, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
multipass algorithms, distribution, sorting, randomization, merging, external memory, input/output, external sorting, parallel disks, multiple disks |
30 | Philippe Audebaud, Christine Paulin-Mohring |
Proofs of Randomized Algorithms in Coq. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MPC ![In: Mathematics of Program Construction, 8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006, Proceedings, pp. 49-68, 2006, Springer, 3-540-35631-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Jinkeun Hong |
Randomized Algorithm in Embedded Crypto Module. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICONIP (3) ![In: Neural Information Processing, 13th International Conference, ICONIP 2006, Hong Kong, China, October 3-6, 2006, Proceedings, Part III, pp. 1122-1130, 2006, Springer, 3-540-46484-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Lusheng Wang 0001, Liang Dong, Hui Fan |
Randomized Algorithms for Motif Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 884-895, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Gethin Norman |
Analysing Randomized Distributed Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Validation of Stochastic Systems ![In: Validation of Stochastic Systems - A Guide to Current Research, pp. 384-418, 2004, Springer, 3-540-22265-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Ingo Wegener |
Randomized Search Heuristics as an Alternative to Exact Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Logic versus Approximation ![In: Logic versus Approximation, Essays Dedicated to Michael M. Richter on the Occasion of his 65th Birthday, pp. 138-149, 2004, Springer, 3-540-22562-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Frank Neumann 0001, Ingo Wegener |
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (1) ![In: Genetic and Evolutionary Computation - GECCO 2004, Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings, Part I, pp. 713-724, 2004, Springer, 3-540-22344-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee |
Time-space trade-off lower bounds for randomized computation of decision problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 50(2), pp. 154-195, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
element distinctness, Branching programs, quadratic forms, random-access machines |
30 | Martin Sauerhoff |
On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings, pp. 488-499, 1999, Springer. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 9721 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|