Search results for "randomized"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
17	Oded Goldreich 0001, Shafi Goldwasser, Eric Lehman, Dana Ron	Testing Monotonicity.	FOCS	1998	DBLP DOI BibTeX RDF	Approximation Algorithms, Randomized Algorithms, Monotonicity, Property Testing
17	Ronald I. Greenberg, Hyeong-Cheol Oh	Universal Wormhole Routing.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	area-universal networks, fat-tree interconnection network, Wormhole routing, packet routing, greedy routing, randomized routing
17	Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka	Practical Algorithms for Selection on Coarse-Grained Parallel Computers.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	median finding, parallel algorithms, load balancing, parallel computers, hypercubes, randomized algorithms, meshes, selection, Coarse-grained
17	Ron Shamir, Dekel Tsur	Faster subtree isomorphism.	ISTCS	1997	DBLP DOI BibTeX RDF	subtree isomorphism problem, graph theory, randomized algorithm, trees, trees (mathematics), computation time, vertices, decision problem
17	Yu-Kwong Kwok, Ishfaq Ahmad	A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors.	IEEE PACT	1997	DBLP DOI BibTeX RDF	parallel randomized algorithm, PFAST algorithm, parallel fast assignment, parallel random search technique, computer-aided parallelization, computer-aided scheduling tool, CASCH tool, running time constraints, parallel programming, parallel programs, multiprocessors, time complexity, directed acyclic graphs, execution times, linear-time algorithm, Intel Paragon, compile-time scheduling
17	Amos Fiat, Manor Mendel	Truly Online Paging with Locality of Reference.	FOCS	1997	DBLP DOI BibTeX RDF	online paging, access graph model, strongly competitive paging algorithm, access sequence, competitive deterministic algorithm, competitive randomized algorithm, page slots, virtual address space, virtual translation tables, probabilistic data structures, extended access graph, memory, locality of reference, paged storage
17	Raouf Benjemaa, Francis Schmitt	Fast Global Registration of 3D Sampled Surfaces using a Multi-Z-Buffer Technique.	3DIM	1997	DBLP DOI BibTeX RDF	fast global registration, 3D sampled surfaces, multi-z-buffer technique, overlapping 3D surfaces, 3D space partitioning, point-to-point correspondence, randomized iterative registration, highly curved objects, test, segmentation, search, image registration, image sampling, nearest neighbours, ICP algorithm, iterative closest point algorithm
17	David R. Karger, Clifford Stein 0001	A New Approach to the Minimum Cut Problem.	J. ACM	1996	DBLP DOI BibTeX RDF	parallel computing, randomized algorithm, graph algorithm, network reliability, minimum cut
17	Shlomi Dolev, Amos Israeli, Shlomo Moran	Analyzing Expected Time by Scheduler-Luck Games.	IEEE Trans. Software Eng.	1995	DBLP DOI BibTeX RDF	leader election, Self-stabilizing systems, randomized distributed algorithms
17	Jamshed N. Patel, Ashfaq A. Khokhar, Leah H. Jamieson	Scalable parallel list ranking of image edges on fine-grained machines.	IPPS	1995	DBLP DOI BibTeX RDF	fine-grained machines, scalable parallel list ranking, image edges, fine-grained list ranking algorithms, image edge lists, edge link spatial locality, actual edge data, synthetic edge data, MasPar MP-2, performance, parallel algorithms, edge detection, randomized algorithm, parallel machines, software performance evaluation, speedup, randomised algorithms, list processing, locality properties, data-dependent operation, MasPar MP-1
17	Raimo Rask, Petteri Laamanen, Kalle Lyytinen	Simulation and Comparison of Albrecht's Function Point and DeMarco's Function Bang Metrics in a CASE Environment.	IEEE Trans. Software Eng.	1993	DBLP DOI BibTeX RDF	specification level metrics, function bang metrics, automatically generated randomized dataflow diagrams, built CASE environment, statistical correlation, software development, software tools, software metrics, software cost estimation, software cost estimation, simulation study, function points, system specifications, statistical sample, software size estimates, DFDs
17	Jirí Matousek 0001, Micha Sharir, Emo Welzl	A Subexponential Bound for Linear Programming.	SCG	1992	DBLP DOI BibTeX RDF	computational geometry, linear programming, combinatorial optimization, randomized incremental algorithms
17	Micha Sharir, Emo Welzl	A Combinatorial Bound for Linear Programming and Related Problems.	STACS	1992	DBLP DOI BibTeX RDF	computational geometry, linear programming, combinatorial optimization, randomized incremental algorithms
17	Ketan Mulmuley	A Fast Planar Partition Algorithm, II.	J. ACM	1991	DBLP DOI BibTeX RDF	randomized geometric algorithms, computational complexity, computational geometry, hidden surface removal, planar subdivision
17	Rolf Klein, Kurt Mehlhorn, Stefan Meiser	On the Construction of Abstract Voronoi Diagrams, II.	SIGAL International Symposium on Algorithms	1990	DBLP DOI BibTeX RDF	randomized algorithms, Voronoi diagrams
16	Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Slivkins	Truthful mechanisms with implicit payment computation.	EC	2010	DBLP DOI BibTeX RDF	single-parameter mechanism design, truthful auctions, multi-armed bandits
16	Pinyan Lu, Xiaorui Sun, Yajun Wang 0001, Zeyuan Allen Zhu	Asymptotically optimal strategy-proof mechanisms for two-facility games.	EC	2010	DBLP DOI BibTeX RDF	strategy-proof, game theory, algorithmic mechanism design, social choice
16	Dmitry G. Korzun, Andrei V. Gurtov	A local equilibrium model for P2P resource ranking.	SIGMETRICS Perform. Evaluation Rev.	2009	DBLP DOI BibTeX RDF
16	Sipat Triukose, Zhihua Wen, Michael Rabinovich	Content delivery networks: how big is big enough?	SIGMETRICS Perform. Evaluation Rev.	2009	DBLP DOI BibTeX RDF
16	Alma Riska, Erik Riedel	Evaluation of disk-level workloads at different time scales.	SIGMETRICS Perform. Evaluation Rev.	2009	DBLP DOI BibTeX RDF
16	Peter Damaschke, Phuong Hoai Ha, Philippas Tsigas	Online Search with Time-Varying Price Bounds.	Algorithmica	2009	DBLP DOI BibTeX RDF	Game theory, Online algorithms, Competitive analysis, Search algorithms
16	Bodo Manthey, L. Shankar Ram	Approximation Algorithms for Multi-Criteria Traveling Salesman Problems.	Algorithmica	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Traveling salesman problem, Multi-criteria optimization
16	Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik	Many-to-Many Communication in Radio Networks.	Algorithmica	2009	DBLP DOI BibTeX RDF	Many-to-many communication, Centralized protocol, Broadcast, Randomization, Gossiping, Radio network, Distributed protocol
16	James Aspnes, Keren Censor	Approximate shared-memory counting despite a strong adversary.	SODA	2009	DBLP DOI BibTeX RDF
16	Carsten Witt	Greedy Local Search and Vertex Cover in Sparse Random Graphs.	TAMC	2009	DBLP DOI BibTeX RDF
16	Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen	On Revenue Maximization in Second-Price Ad Auctions.	ESA	2009	DBLP DOI BibTeX RDF
16	Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo	Optimal sampling from sliding windows.	PODS	2009	DBLP DOI BibTeX RDF	data streams, random sampling, sliding windows
16	Tarcizio Alexandre Bini, Adriano Lange, Marcos Sfair Sunyé, Fabiano Silva	Stableness in large join query optimization.	ISCIS	2009	DBLP DOI BibTeX RDF
16	Moshe Babaioff, Jason D. Hartline, Robert D. Kleinberg	Selling ad campaigns: online algorithms with cancellations.	EC	2009	DBLP DOI BibTeX RDF	costly decision revocation, selling advertisements, online algorithms, matroids, knapsack
16	László Babai, Robert Beals, Ákos Seress	Polynomial-time theory of matrix groups.	STOC	2009	DBLP DOI BibTeX RDF	computational group theory, matrix groups, discrete log
16	Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu	Trading Infinite Memory for Uniform Randomness in Timed Games.	HSCC	2008	DBLP DOI BibTeX RDF
16	Eric V. Denardo, Eugene A. Feinberg, Uriel G. Rothblum	On occupation measures for total-reward MDPs.	CDC	2008	DBLP DOI BibTeX RDF
16	Giovanni Chiola, Marina Ribaudo	Neighbor-of-neighbor routing over deterministically modulated Chord-like DHTs.	IPDPS	2008	DBLP DOI BibTeX RDF
16	Vladimir V. V'yugin	On Sequences with Non-learnable Subsequences.	CSR	2008	DBLP DOI BibTeX RDF
16	Adrian Dumitrescu, Howi Kok, Ichiro Suzuki, Pawel Zylinski	Vision-Based Pursuit-Evasion in a Grid.	SWAT	2008	DBLP DOI BibTeX RDF
16	Yossi Azar, Uriel Feige, Daniel Glasner	A Preemptive Algorithm for Maximizing Disjoint Paths on Trees.	SWAT	2008	DBLP DOI BibTeX RDF
16	Martin Fürer, Shiva Prasad Kasiviswanathan	Approximately Counting Embeddings into Random Graphs.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
16	Regant Y. S. Hung, Kwok Fai Lai, Hing-Fung Ting	Finding Frequent Items in a Turnstile Data Stream.	COCOON	2008	DBLP DOI BibTeX RDF
16	Haitao Wang 0001, Amitabh Chaudhary, Danny Z. Chen	New Algorithms for Online Rectangle Filling with k-Lookahead.	COCOON	2008	DBLP DOI BibTeX RDF
16	Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani 0001, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas	Querying priced information in databases: The conjunctive case.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	online algorithms, Competitive analysis
16	Haiying Shen, Cheng-Zhong Xu 0001	Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks.	IEEE Trans. Parallel Distributed Syst.	2007	DBLP DOI BibTeX RDF	Cycloid, peer-to-peer, load balancing, distributed hash table, heterogeneity, proximity
16	Santonu Sarkar, Girish Maskeri Rama, Avinash C. Kak	API-Based and Information-Theoretic Metrics for Measuring the Quality of Software Modularization.	IEEE Trans. Software Eng.	2007	DBLP DOI BibTeX RDF	modules and interfaces, maintenance and enhancement, distribution, information theory, coupling, maintainability, layered architecture, Metrics/measurement
16	Christopher M. Jermaine	Online Random Shuffling of Large Database Tables.	IEEE Trans. Knowl. Data Eng.	2007	DBLP DOI BibTeX RDF	database systems, Sampling methods
16	Raphael Yuster, Uri Zwick	Maximum matching in graphs with an excluded minor.	SODA	2007	DBLP BibTeX RDF
16	Nikhil Bansal 0001, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko	Dynamic pricing for impatient bidders.	SODA	2007	DBLP BibTeX RDF
16	Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafail Ostrovsky	Round Complexity of Authenticated Broadcast with a Dishonest Majority.	FOCS	2007	DBLP DOI BibTeX RDF
16	Wolfgang W. Bein, Lawrence L. Larmore, John Noga	Equitable Revisited.	ESA	2007	DBLP DOI BibTeX RDF	Online Algorithms, Randomization, Paging, Design of Algorithms
16	Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel	Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity.	ICALP	2007	DBLP DOI BibTeX RDF
16	Robert Elsässer, Thomas Sauerwald	Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs.	STACS	2007	DBLP DOI BibTeX RDF
16	Fabian Kuhn, Thomas Locher, Roger Wattenhofer	Tight bounds for distributed selection.	SPAA	2007	DBLP DOI BibTeX RDF	sensor networks, distributed algorithms, time complexity, data aggregation, median, in-network aggregation
16	Benny Applebaum, Yuval Ishai, Eyal Kushilevitz	Computationally Private Randomizing Polynomials and Their Applications.	Comput. Complex.	2006	DBLP DOI BibTeX RDF	Subject classification. 94A60, 68P25, 68Q15
16	Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson	A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness.	Comput. Complex.	2006	DBLP DOI BibTeX RDF	06D15, 68Q17, 68Q15, 06E30, Subject classification. 68Q10
16	Marcin Jurdzinski, Mike Paterson, Uri Zwick	A deterministic subexponential algorithm for solving parity games.	SODA	2006	DBLP DOI BibTeX RDF
16	Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik	On Many-to-Many Communication in Packet Radio Networks.	OPODIS	2006	DBLP DOI BibTeX RDF
16	Yoshihiko Mochizuki, Akihiko Torii, Atsushi Imiya	N-Point Hough Transform Derived by Geometric Duality.	PSIVT	2006	DBLP DOI BibTeX RDF
16	Joseph Naor	From Balanced Graph Partitioning to Balanced Metric Labeling.	ESA	2005	DBLP DOI BibTeX RDF
16	Shafi Goldwasser, Madhu Sudan 0001, Vinod Vaikuntanathan	Distributed Computing with Imperfect Randomness.	DISC	2005	DBLP DOI BibTeX RDF
16	Ankur Bhargava, S. Rao Kosaraju	Derandomization of Dimensionality Reduction and SDP Based Algorithms.	WADS	2005	DBLP DOI BibTeX RDF
16	Benny Applebaum, Yuval Ishai, Eyal Kushilevitz	Computationally Private Randomizing Polynomials and Their Applications.	CCC	2005	DBLP DOI BibTeX RDF
16	Carla P. Gomes, David B. Shmoys	Approximations and Randomization to Boost CSP Techniques.	Ann. Oper. Res.	2004	DBLP DOI BibTeX RDF
16	Rani Yaroshinsky, Ran El-Yaniv, Steven S. Seiden	How to Better Use Expert Advice.	Mach. Learn.	2004	DBLP DOI BibTeX RDF	online prediction, learning from expert advice, online learning
16	Ran Mendelson, Mikkel Thorup, Uri Zwick	Meldable RAM priority queues and minimum directed spanning trees.	SODA	2004	DBLP BibTeX RDF
16	Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor	A general approach to online network optimization problems.	SODA	2004	DBLP BibTeX RDF
16	Johannes Blömer, Jorge Guajardo, Volker Krummel	Provably Secure Masking of AES.	Selected Areas in Cryptography	2004	DBLP DOI BibTeX RDF
16	Yair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jirí Sgall, Tomás Tichý	Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.	STACS	2004	DBLP DOI BibTeX RDF
16	Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar 0001	Multi-processor scheduling to minimize flow time with epsilon resource augmentation.	STOC	2004	DBLP DOI BibTeX RDF	multi-processor scheduling, load balancing, online algorithms, stretch, resource augmentation, flow time
16	Susanne Albers, Markus Schmidt 0003	On the performance of greedy algorithms in packet buffering.	STOC	2004	DBLP DOI BibTeX RDF	network switch, throughput, competitive, buffer, online, packet, greedy
16	Guojing Cong, David A. Bader	The Euler Tour Technique and Parallel Rooted Spanning Tree.	ICPP	2004	DBLP DOI BibTeX RDF	High-Performance Algorithm Engineering, Shared Memory, Spanning Tree, Parallel Graph Algorithms, Euler Tour
16	Hartmut Klauck	Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds.	FSTTCS	2004	DBLP DOI BibTeX RDF
16	Vikraman Arvind, Piyush P. Kurur	Upper Bounds on the Complexity of Some Galois Theory Problems.	ISAAC	2003	DBLP DOI BibTeX RDF
16	Gaurav S. Kc, Angelos D. Keromytis, Vassilis Prevelakis	Countering code-injection attacks with instruction-set randomization.	CCS	2003	DBLP DOI BibTeX RDF	interpreters, emulators, buffer overflows
16	Susanne Albers, Helge Bals	Dynamic TCP acknowledgement: penalizing long delays.	SODA	2003	DBLP BibTeX RDF	TCP/IP
16	Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos	An approximate truthful mechanism for combinatorial auctions with single parameter agents.	SODA	2003	DBLP BibTeX RDF
16	Thomas Hofmeister	An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint.	ESA	2003	DBLP DOI BibTeX RDF
16	Juraj Hromkovic, Georg Schnitger	Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes.	ICALP	2003	DBLP DOI BibTeX RDF	multicounter machines, randomization, nondeterminism, complexity theory, pushdown automata
16	Joseph Y. Halpern, Riccardo Pucella	Probabilistic algorithmic knowledge.	TARK	2003	DBLP DOI BibTeX RDF
16	Chris Karlof, David A. Wagner 0001	Hidden Markov Model Cryptanalysis.	CHES	2003	DBLP DOI BibTeX RDF
16	Thomas P. Hayes, Samuel Kutin, Dieter van Melkebeek	The Quantum Black-Box Complexity of Majority.	Algorithmica	2002	DBLP DOI BibTeX RDF
16	Grammati E. Pantziou, George P. Pentaris, Paul G. Spirakis	Competitive Call Control in Mobile Networks.	Theory Comput. Syst.	2002	DBLP DOI BibTeX RDF
16	Pilar de la Torre	How Efficiently Can Room at the Bottom Be Traded Away for Speed at the Top?	DNA	2002	DBLP DOI BibTeX RDF
16	Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe 0001	A Probabilistic 3-SAT Algorithm Further Improved.	STACS	2002	DBLP DOI BibTeX RDF
16	Angelos Stavrou, Dan Rubenstein, Sambit Sahu	A Lightweight, Robust P2P System to Handle Flash Crowds.	ICNP	2002	DBLP DOI BibTeX RDF
16	Olivier Bournez, Claude Kirchner	Probabilistic Rewrite Strategies. Applications to ELAN.	RTA	2002	DBLP DOI BibTeX RDF
16	Miklós Ajtai, T. S. Jayram, Ravi Kumar 0001, D. Sivakumar 0001	Approximate counting of inversions in a data stream.	STOC	2002	DBLP DOI BibTeX RDF
16	Marco Pellegrini 0001	Randomizing combinatorial algorithms for linear programming when the dimension is moderately high.	SODA	2001	DBLP BibTeX RDF
16	Leah Epstein	On-Line Variable Sized Covering.	COCOON	2001	DBLP DOI BibTeX RDF
16	Jop F. Sibeyn	Better Deterministic Routing on Meshes.	IPPS/SPDP	1999	DBLP DOI BibTeX RDF
16	Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger	Parametric and Kinetic Minimum Spanning Trees.	FOCS	1998	DBLP DOI BibTeX RDF
16	Leah Epstein	Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines.	APPROX	1998	DBLP DOI BibTeX RDF
16	Vijay Kumar	Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks.	APPROX	1998	DBLP DOI BibTeX RDF
16	Hirotsugu Kakugawa, Masafumi Yamashita	Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	unfair daemon, fault tolerance, distributed algorithms, self-stabilization, mutual exclusion, Ring networks
16	N. V. Vinodchandran	Improved Lowness Results for Solvable Black-box Group Problems.	FSTTCS	1997	DBLP DOI BibTeX RDF
16	Miroslaw Kutylowski, Tomasz Wierzbicki	Approximate Compaction and Padded-Sorting on Exclusive Write PRAMs.	IPPS	1996	DBLP DOI BibTeX RDF
16	Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon	Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract).	COLT	1994	DBLP DOI BibTeX RDF
16	Yossi Azar, Joseph Naor, Raphael Rom	The Competitiveness of On-Line Assignments.	SODA	1992	DBLP BibTeX RDF
16	Torben Hagerup	Fast and Optimal Simulations between CRCW PRAMs.	STACS	1992	DBLP DOI BibTeX RDF
16	Charles U. Martel, Ramesh Subramonian	On the Complexity of Certified Write All Algorithms.	FSTTCS	1992	DBLP DOI BibTeX RDF
16	Rainer Schuler, Tomoyuki Yamakami	Structural Average Case Complexity.	FSTTCS	1992	DBLP DOI BibTeX RDF
14	Telex Magloire Nkouatchah Ngatched, Attahiru Sule Alfa, Jun Cai 0001	Cooperative sensing with transmit diversity based on randomized STBC in CR networks.	IWCMC	2010	DBLP DOI BibTeX RDF	sensing throughput tradeoff, optimization, cognitive radio networks, cooperative sensing
14	Shichuan Ma, Michael Hempel, Yaoqing (Lamar) Yang, Hamid Sharif	An approach to secure wireless communications using randomized eigenvector-based jamming signals.	IWCMC	2010	DBLP DOI BibTeX RDF	physical layer security, secrecy capacity