Patents by Inventor Simon Karl ZONABEND

Simon Karl ZONABEND has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • COMBINATORIAL MATCHING TECHNIQUES FOR ELECTRONIC DATA MESSAGES
    Publication number: 20230315795
    Abstract: A computer system includes a memory that stores two lists of electronic data transaction requests. Stored and received data transaction requests are associated with a size value and a counter-size requirement value. When data transaction requests are received they are added to one of the two lists and list to which the data transaction request is added is set to a working side. A working order is selected from the working side and a first sum of size values of data transaction requests is calculated from the working side. A second sum of size values is calculated from the non-working side from data transaction requests that have a counter-size requirement value that is less than the first sum. If the counter-size requirement value is less than or equal to the second sum, the electronic data requests from the respective lists are matched.
    Type: Application
    Filed: June 8, 2023
    Publication date: October 5, 2023
    Inventor: Simon Karl ZONABEND
  • Combinatorial matching techniques for electronic data messages
    Patent number: 11714863
    Abstract: A computer system includes a memory that stores two lists of electronic data transaction requests. Stored and received data transaction requests are associated with a size value and a counter-size requirement value. When data transaction requests are received they are added to one of the two lists and list to which the data transaction request is added is set to a working side. A working order is selected from the working side and a first sum of size values of data transaction requests is calculated from the working side. A second sum of size values is calculated from the non-working side from data transaction requests that have a counter-size requirement value that is less than the first sum. If the counter-size requirement value is less than or equal to the second sum, the electronic data requests from the respective lists are matched.
    Type: Grant
    Filed: April 20, 2021
    Date of Patent: August 1, 2023
    Assignee: NASDAQ TECHNOLOGY AB
    Inventor: Simon Karl Zonabend
  • COMBINATORIAL MATCHING TECHNIQUES FOR ELECTRONIC DATA MESSAGES
    Publication number: 20210240790
    Abstract: A computer system includes a memory that stores two lists of electronic data transaction requests. Stored and received data transaction requests are associated with a size value and a counter-size requirement value. When data transaction requests are received they are added to one of the two lists and list to which the data transaction request is added is set to a working side. A working order is selected from the working side and a first sum of size values of data transaction requests is calculated from the working side. A second sum of size values is calculated from the non-working side from data transaction requests that have a counter-size requirement value that is less than the first sum. If the counter-size requirement value is less than or equal to the second sum, the electronic data requests from the respective lists are matched.
    Type: Application
    Filed: April 20, 2021
    Publication date: August 5, 2021
    Inventor: Simon Karl ZONABEND
  • Combinatorial matching techniques for electronic data messages
    Patent number: 11010439
    Abstract: A computer system includes a memory that stores two lists of electronic data transaction requests. Stored and received data transaction requests are associated with a size value and a counter-size requirement value. When data transaction requests are received they are added to one of the two lists and list to which the data transaction request is added is set to a working side. A working order is selected from the working side and a first sum of size values of data transaction requests is calculated from the working side. A second sum of size values is calculated from the non-working side from data transaction requests that have a counter-size requirement value that is less than the first sum. If the counter-size requirement value is less than or equal to the second sum, the electronic data requests from the respective lists are matched.
    Type: Grant
    Filed: March 1, 2019
    Date of Patent: May 18, 2021
    Assignee: NASDAQ TECHNOLOGY AB
    Inventor: Simon Karl Zonabend
  • COMBINATIONAL MATCHING TECHNIQUES FOR ELECTRONIC DATA MESSAGES
    Publication number: 20190205350
    Abstract: A computer system includes a memory that stores two lists of electronic data transaction requests. Stored and received data transaction requests are associated with a size value and a counter-size requirement value. When data transaction requests are received they are added to one of the two lists and list to which the data transaction request is added is set to a working side. A working order is selected from the working side and a first sum of size values of data transaction requests is calculated from the working side. A second sum of size values is calculated from the non-working side from data transaction requests that have a counter-size requirement value that is less than the first sum. If the counter-size requirement value is less than or equal to the second sum, the electronic data requests from the respective lists are matched.
    Type: Application
    Filed: March 1, 2019
    Publication date: July 4, 2019
    Inventor: Simon Karl ZONABEND
  • Combinatorial matching techniques for electronic data messages
    Patent number: 10255368
    Abstract: A computer system includes a memory that stores two lists of electronic data transaction requests. Stored and received data transaction requests are associated with a size value and a counter-size requirement value. When data transaction requests are received they are added to one of the two lists and list to which the data transaction request is added is set to a working side. A working order is selected from the working side and a first sum of size values of data transaction requests is calculated from the working side. A second sum of size values is calculated from the non-working side from data transaction requests that have a counter-size requirement value that is less than the first sum. If the counter-size requirement value is less than or equal to the second sum, the electronic data requests from the respective lists are matched.
    Type: Grant
    Filed: March 17, 2016
    Date of Patent: April 9, 2019
    Assignee: NASDAQ TECHNOLOGY AB
    Inventor: Simon Karl Zonabend
  • COMBINATORIAL MATCHING TECHNIQUES FOR ELECTRONIC DATA MESSAGES
    Publication number: 20160283599
    Abstract: A computer system includes a memory that stores two lists of electronic data transaction requests. Stored and received data transaction requests are associated with a size value and a counter-size requirement value. When data transaction requests are received they are added to one of the two lists and list to which the data transaction request is added is set to a working side. A working order is selected from the working side and a first sum of size values of data transaction requests is calculated from the working side. A second sum of size values is calculated from the non-working side from data transaction requests that have a counter-size requirement value that is less than the first sum. If the counter-size requirement value is less than or equal to the second sum, the electronic data requests from the respective lists are matched.
    Type: Application
    Filed: March 17, 2016
    Publication date: September 29, 2016
    Inventor: Simon Karl ZONABEND