| 
      
      
       
      
      My UW
      | 
      UW Search
       
      
          
          
      
      Computer Science Home Page 
	  
	  
	  
       
      
      Theory Group Home Page
       
       
       
      
      Biography
       
      
      Publications
       
      
      Teaching
       
      
      Contact Information 
  
       | 
 | 
      
   
     
    
    
    | 
 
  | 
     
  
 
	 Nicollas Mocelin Sdroievski
 
     List of publications 
    
    
    - N. M. Sdroievski.Derandomization vs. Lower Bounds for Arthur-Merlin protocols.
        PhD thesis, 2024.
 
      
    -  D. van Melkebeek, N. M. Sdroievski. Leakage Resilience, Targeted Pseudorandom Generators, and Mild Derandomization of Arthur-Merlin Protocols.
        In 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 264, pp. 17:1-17:36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023).
 
    -  D. van Melkebeek, N. M. Sdroievski. Instance-Wise Hardness Versus Randomness Tradeoffs for Arthur-Merlin Protocols.
    In 38th Computational Complexity Conference (CCC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 264, pp. 17:1-17:36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023).
 
    
    - N. M. Sdroievski, M. V. G. da Silva and A. L. Vignatti. 
      Conhecimento Zero Estatístico e Reduções Eficientes para o problema MKTP
       [Statistical Zero Knowledge and Efficient Reductions to MKTP]. Third place Master's thesis at the
       32nd CTD (Thesis and Dissertation Context), part of the 39th CSBC (Brazilian Computing Society Congress), 2019. Full thesis available
     here (in Portuguese).
 
    -  N. M. Sdroievski, M. V. G. da Silva and A. L. Vignatti. 
      The Hidden Subgroup Problem and MKTP. Theoretical Computer Science, vol. 795,
      pp. 204-212, 2019.
 
    
		
		-  N. M. Sdroievski and M. V. G. da Silva. 
       Algoritmos Aleatorizados com Oráculo para MCSP: Aplicações para o
       Problema do Resíduo Quadrático e do Logaritmo Discreto [Randomized Algorithms with
       an MCSP Oracle: The Quadratic Residue and Discrete Logarithm Problems]. 36th CSBC
       (Brazilian Computing Society Congress), 2016.
 
		-   M. A. Amaral, N. M. Sdroievski,  L. Cordeiro and P. Castelini Sobre experiências, críticas e potenciais: computação física educacional e altas habilidades [On experiences, critiques and potential: physical computing education and high abilities]. Book Chapter in:  R. B. Silva and  P. Blinkstein. Robótica e computação física na educação brasileira [Robotics and physical computing in Brazilian eduction]. Porto Alegre. Penso, 2020.
 
     
	
 
  
   | 
   
 
 | 
 |