Остановите войну!
for scientists:
default search action
Tugkan Batu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c15]Tugkan Batu, Amitabh Trehan, Chhaya Trehan:
All You Need are Random Walks: Fast and Simple Distributed Conductance Testing. SIROCCO 2024: 64-82 - 2023
- [i4]Tugkan Batu, Chhaya Trehan:
A Distributed Conductance Tester Without Global Information Collection. CoRR abs/2305.14178 (2023)
2010 – 2019
- 2017
- [c14]Tugkan Batu, Clément L. Canonne:
Generalized Uniformity Testing. FOCS 2017: 880-889 - [i3]Tugkan Batu, Clément L. Canonne:
Generalized Uniformity Testing. CoRR abs/1708.04696 (2017) - 2016
- [c13]Tugkan Batu, Pongphat Taptagaporn:
Competitive Portfolio Selection Using Stochastic Predictions. ALT 2016: 288-302 - 2013
- [j5]Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White:
Testing Closeness of Discrete Distributions. J. ACM 60(1): 4:1-4:25 (2013) - 2012
- [j4]Tugkan Batu, Petra Berenbrink, Colin Cooper:
Chains-into-bins processes. J. Discrete Algorithms 14: 21-28 (2012) - 2010
- [c12]Tugkan Batu, Petra Berenbrink, Colin Cooper:
Chains-into-Bins Processes. IWOCA 2010: 314-325 - [i2]Tugkan Batu, Petra Berenbrink, Colin Cooper:
Chains-into-Bins Processes. CoRR abs/1005.2616 (2010) - [i1]Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White:
Testing Closeness of Discrete Distributions. CoRR abs/1009.5397 (2010)
2000 – 2009
- 2009
- [j3]Tugkan Batu, Petra Berenbrink, Christian Sohler:
A sublinear-time approximation scheme for bin packing. Theor. Comput. Sci. 410(47-49): 5082-5092 (2009) - 2006
- [c11]Tugkan Batu, Funda Ergün, Süleyman Cenk Sahinalp:
Oblivious string embeddings and edit distance approximations. SODA 2006: 792-801 - 2005
- [j2]Tugkan Batu, Ronitt Rubinfeld, Patrick White:
Fast approximate PCPs for multidimensional bin-packing problems. Inf. Comput. 196(1): 42-56 (2005) - [j1]Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld:
The Complexity of Approximating the Entropy. SIAM J. Comput. 35(1): 132-150 (2005) - [c10]Tugkan Batu, Süleyman Cenk Sahinalp:
Locally Consistent Parsing and Applications to Approximate String Comparisons. Developments in Language Theory 2005: 22-35 - 2004
- [c9]Tugkan Batu, Sudipto Guha, Sampath Kannan:
Inferring Mixtures of Markov Chains. COLT 2004: 186-199 - [c8]Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andrew McGregor:
Reconstructing strings from random traces. SODA 2004: 910-918 - [c7]Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld:
Sublinear algorithms for testing monotone and unimodal distributions. STOC 2004: 381-390 - 2003
- [c6]Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami:
A sublinear algorithm for weakly approximating edit distance. STOC 2003: 316-324 - 2002
- [c5]Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld:
The Complexity of Approximating the Entropy. CCC 2002: 17 - [c4]Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld:
The complexity of approximating entropy. STOC 2002: 678-687 - 2001
- [b1]Tugkan Batu:
Testing Properties of Distributions. Cornell University, USA, 2001 - [c3]Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White:
Testing Random Variables for Independence and Identity. FOCS 2001: 442-451 - 2000
- [c2]Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White:
Testing that distributions are close. FOCS 2000: 259-269
1990 – 1999
- 1999
- [c1]Tugkan Batu, Ronitt Rubinfeld, Patrick White:
Fast Approximate PCPs for Multidimensional Bin-Packing Problems. RANDOM-APPROX 1999: 245-256
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-07 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint