|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 12 publication records. Showing 12 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ankit Gupta, Neeraj Kayal, Youming Qiao |
Random Arithmetic Formulas can be Reconstructed Efficiently.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Youming Qiao |
On the security of Goldreich's one-way function. |
Computational Complexity |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | László Babai, Youming Qiao |
Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | László Babai, Paolo Codenotti, Joshua A. Grochow, Youming Qiao |
Code Equivalence and Group Isomorphism. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Youming Qiao, Jayalal M. N. Sarma, Bangsheng Tang |
On Isomorphism Testing of Groups with Normal Hall Subgroups. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma |
Deterministic Identity Testing of Read-Once Algebraic Branching Programs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma |
Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma |
Deterministic Black-Box Identity Testing $\pi$-Ordered Algebraic Branching Programs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma |
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma |
Deterministic Identity Testing of Read-Once Algebraic Branching Programs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Youming Qiao |
On the Security of Goldreich's One-Way Function. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Youming Qiao, Christophe Tartary |
Counting Method for Multi-party Computation over Non-abelian Groups. |
CANS |
2008 |
DBLP DOI BibTeX RDF |
Neighbor-Avoiding Walk, Random Walk, Graph Coloring, Multiparty Computation, Non-Abelian Groups, Passive Adversary |
Displaying result #1 - #12 of 12 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")