Author image not provided
 Yiannis N Moschovakis

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article5.93
Citation Count89
Publication count15
Publication years1974-2009
Available for download2
Average downloads per article225.50
Downloads (cumulative)451
Downloads (12 Months)17
Downloads (6 Weeks)2
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Advisor only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


15 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 15 of 15
Sort by:

1
September 2009 CSL'09/EACSL'09: Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0


2 published by ACM
January 2009 ACM Transactions on Computational Logic (TOCL): Volume 10 Issue 1, January 2009
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 11,   Downloads (Overall): 288

Full text available: PDFPDF
We obtain lower bounds on the cost of computing various arithmetic functions and deciding various arithmetic relations from specified primitives. This includes lower bounds for computing the greatest common divisor and deciding coprimeness of two integers, from primitives like addition, subtraction, division with remainder and multiplication. Some of our results ...
Keywords: coprimeness, recursive programs, Lower bounds for arithmetical problems, greatest common divisor

3
June 2008 LICS '08: Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0


4
June 2005 CiE'05: Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

My purpose in this lecture is to explain how the representation of algorithms by recursive programs can be used in complexity theory, especially in the derivation of lower bounds for worst-case time complexity, which apply to all —or, at least, a very large class of—algorithms. It may be argued that ...

5
May 2003 Theoretical Computer Science: Volume 301 Issue 1-3, 14 May 2003
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 3

We establish linear lower bounds for the complexity of non-trivial, primitive recursive algorithms from piecewise linear given functions. The main corollary is that logtime algorithms for the greatest common divisor from such givens (such as Stein's ) cannot be matched in efficiency by primitive recursive algorithms from the same given ...
Keywords: relative primitive recursion, greatest common divisor

6
May 2003 Theoretical Computer Science: Volume 301 Issue 1, May 2003
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 1

We establish linear lower bounds for the complexity of non-trivial, primitive recursive algorithms from piecewise linear given functions. The main corollary is that logtime algorithms for the greatest common divisor from such givens (such as Stein�s) cannot be matched in efficiency by primitive recursive algorithms from the same given functions. ...
Keywords: Greatest common divisor, Relative primitive recursion

7
August 1997 CSL '97: Selected Papers from the11th International Workshop on Computer Science Logic
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1


8
March 1995 Theoretical Computer Science: Volume 139 Issue 1-2, March 6 1995
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0


9
September 1994 CSL '94: Selected Papers from the 8th International Workshop on Computer Science Logic
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0


10
March 1994
Bibliometrics:
Citation Count: 12


11 published by ACM
December 1989 POPL '90: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 6,   Downloads (Overall): 163

Full text available: PDFPDF
In this paper we study concurrent, asynchronous processes and functions on them which can be programmed using the (full) unfair or the fair merge operations. The main result is a normal form theorem for these (relatively) “computable process functions” which implies that although they can be very complex when viewed ...

12
July 1989 Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0


13
July 1989 Logic at Botik'89 Symposium on logical foundations of computer science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0


14
June 1989 Proceedings of the Fourth Annual Symposium on Logic in computer science
Publisher: IEEE Press
Bibliometrics:
Citation Count: 2


15



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us