The following pages link to Xiaoming Sun (Q369427):
Displaying 50 items.
- On a conjecture of Butler and Graham (Q369429) (← links)
- An improved lower bound on the sensitivity complexity of graph properties (Q551172) (← links)
- Performance evaluation for energy efficient topologic control in ad hoc wireless networks (Q703562) (← links)
- Path cooperative games (Q724748) (← links)
- On the quantum query complexity of local search in two and three dimensions (Q835649) (← links)
- Quantum separation of local search and fixed point computation (Q848947) (← links)
- The antimagicness of the Cartesian product of graphs (Q1006045) (← links)
- Universal and original-preserving quantum copying is impossible (Q1348791) (← links)
- A 3-party simultaneous protocol for SUM-INDEX (Q1402220) (← links)
- Partial sorting problem on evolving data (Q1679242) (← links)
- On complexity of single-minded auction (Q1765304) (← links)
- Graph coloring applied to secure computation in non-abelian groups (Q1928772) (← links)
- On the sensitivity complexity of bipartite graph properties (Q1935792) (← links)
- Bounds and trade-offs for double-base number systems (Q1944930) (← links)
- The values of two classes of Gaussian periods in index 2 case and weight distributions of linear codes (Q2025353) (← links)
- Discouraging pool block withholding attacks in bitcoin (Q2125225) (← links)
- Null-free false discovery rate control using decoy permutations (Q2125640) (← links)
- On the optimality of tape merge of two lists with similar size (Q2182103) (← links)
- The formation of social network assortativity: a cultural trait-matching mechanism (Q2225585) (← links)
- The complexity of optimization on grids (Q2319631) (← links)
- Any monotone property of 3-uniform hypergraphs is weakly evasive (Q2348256) (← links)
- Block sensitivity of weakly symmetric functions (Q2382286) (← links)
- Searching monotone multi-dimensional arrays (Q2483400) (← links)
- Higher order monotonicity and submodularity of influence in social networks: from local to global (Q2672246) (← links)
- On the generalized shuffle-exchange problem (Q2694961) (← links)
- The Routing of Complex Contagion in Kleinberg’s Small-World Networks (Q2817872) (← links)
- Streaming and Communication Complexity of Clique Approximation (Q2843271) (← links)
- Determinantal Complexities and Field Extensions (Q2872077) (← links)
- Space-Efficient Approximation Scheme for Circular Earth Mover Distance (Q2894457) (← links)
- The Relationship between Inner Product and Counting Cycles (Q2894505) (← links)
- (Q2904786) (← links)
- Stam’s Conjecture and Threshold Phenomena in Collision Resistance (Q2914271) (← links)
- (Q2934612) (← links)
- On the Power of Parity Queries in Boolean Decision Trees (Q2948457) (← links)
- Space-bounded communication complexity (Q2986867) (← links)
- A Better Upper Bound on Weights of Exact Threshold Functions (Q3010394) (← links)
- (Q3071531) (← links)
- THE COMPLEXITY OF WORD CIRCUITS (Q3084681) (← links)
- A New Variation of Hat Guessing Games (Q3087987) (← links)
- The Least-Core and Nucleolus of Path Cooperative Games (Q3196373) (← links)
- Better Upper Bounds for Searching on a Line with Byzantine Robots (Q3297827) (← links)
- How to Select the Top k Elements from Evolving Data? (Q3459850) (← links)
- (Q3488854) (← links)
- Quantum Separation of Local Search and Fixed Point Computation (Q3511325) (← links)
- GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM (Q3521608) (← links)
- The existence of quantum entanglement catalysts (Q3547672) (← links)
- The Complexity of Word Circuits (Q3578330) (← links)
- Weights of Exact Threshold Functions (Q3586073) (← links)
- More Efficient Algorithms for Closest String and Substring Problems (Q3586187) (← links)
- Graph Design for Secure Multiparty Computation over Non-Abelian Groups (Q3600363) (← links)
