Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

SAKO (programming language)

Known as: SAKO programming language, Sako 
SAKO (PL: System Automatycznego Kodowania Operacji - EN: Automatic Operation Encoding System) is a non-English-based programming language written for… Expand
Wikipedia

Related topics

Related topics

1 relation
Non-English-based programming languages

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Agency, structure, and the dominance of OEMs: Change and stability in the automotive sector
Research summary: This article reviews structural change in the automotive sector from 1997 to 2007. We find that, following… Expand
  • figure 1
  • figure 2
  • figure 4
2011
2011
Practical Remote End-to-End Voting Scheme
Recently, remote voting systems have gained popularity and have been used for government elections and referendums in the United… Expand
  • figure 1
  • figure 2
Highly Cited
2008
Highly Cited
2008
Does familiarity breed trust? Revisiting the antecedents of trust
This paper investigates how the history of interaction between organizations and between organizational boundary spanners… Expand
  • table 1
  • table 3
  • table 4
  • table 5
2007
2007
Multi-designated verifiers signatures: anonymity without encryption
In 1996, Jakobsson, Sako, and Impagliazzo and, on the other hand, Chaum proposed the notion of designated verifier signature to… Expand
Highly Cited
2004
Highly Cited
2004
Learning to Contract: Evidence from the Personal Computer Industry
Organizational forms involving more detailed contracts than are found in traditional spot market exchanges appear to be… Expand
  • figure 1
  • table 1
Highly Cited
2003
Highly Cited
2003
Workplace mentors: demands and benefits
As there is a growing interest in experienced workers mentoring co‐workers in workplace settings, it is necessary to understand… Expand
  • table 1
  • table 2
  • table 2
Highly Cited
2002
Highly Cited
2002
Does Trust Improve Business Performance
Forthcoming In Ctuistel Lane and Rclnhard Backmann (eds.) Trust Within and Between Orgmi:anotu Oxford Univcrsl ty I%css. Does… Expand
  • table 1
  • table 2
  • figure 3
  • figure 4
Highly Cited
2001
Highly Cited
2001
An Efficient Scheme for Proving a Shuffle
In this paper, we propose a novel and efficient protocol for proving the correctness of a shuffle, without leaking how the… Expand
  • table 1
Highly Cited
2000
Highly Cited
2000
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and… Expand
Highly Cited
1996
Highly Cited
1996
Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme
At Eurocrypt'95 Sako and Kilian presented the first Mix-type voting scheme which is receipt-free and universally verifiable. 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE