STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms for the 0-extension problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A New Min-Cut Max-Flow Ratio for Multicommodity Flows
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Complexity of the Sub-permutation Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
A Graph Theoretic Approach to Software Watermarking
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Cuts, Trees and -Embeddings of Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An Efficient Practical Heuristic For Good Ratio-Cut Partitioning
VLSID '03 Proceedings of the 16th International Conference on VLSI Design
Iterative compaction: an improved approach to graph and circuit bisection
EURO-DAC '91 Proceedings of the conference on European design automation
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A fixed-parameter algorithm for the directed feedback vertex set problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
Graph-Theoretic Concepts in Computer Science
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Empirical comparison of algorithms for network community detection
Proceedings of the 19th international conference on World wide web
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Succinct representations of separable graphs
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Computing the cutwidth of bipartite permutation graphs in linear time
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
SybilLimit: a near-optimal social network defense against sybil attacks
IEEE/ACM Transactions on Networking (TON)
Genetic approaches for graph partitioning: a survey
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Optimal lower bounds for universal and differentially private steiner trees and TSPs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Exploiting decomposability using recombination in genetic algorithms: an exploratory discussion
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
Multi-way clustering using super-symmetric non-negative tensor factorization
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part IV
Energy-based clustering of graphs with nonuniform degrees
GD'05 Proceedings of the 13th international conference on Graph Drawing
Heuristic improvements for computing maximum multicommodity flow and minimum multicut
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximation algorithms for requirement cut on graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Progress on crossing number problems
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Physical topology design for all-optical networks
Optical Switching and Networking
Mining groups of common interest: discovering topical communities with network flows
MLDM'13 Proceedings of the 9th international conference on Machine Learning and Data Mining in Pattern Recognition
A derandomized approximation algorithm for the critical node detection problem
Computers and Operations Research
| Hi-index | 0.00 |
A simple construction for a pseudorandom bit generator is presented. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g. P, NC, PSPACE, etc.), using an arbitrary function ...