The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
A. V. Chashkin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. A. V. Chashkin
    Average case complexity for finite Boolean functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:43-59 [Journal]
  2. A. V. Chashkin
    Lower bounds for the complexity of restrictions of Boolean functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:61-93 [Journal]
  3. A. V. Chashkin
    Local complexity of Boolean functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:55-64 [Journal]
  4. A. V. Chashkin
    Computation of Boolean functions by randomized programs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:65-82 [Journal]

Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002